Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Anti-BE-algebra (1)
- Anti-sophication (1)
- BE-algebra (1)
- Coding theory (1)
- Cryptography (1)
-
- Cryptosystem (1)
- N-Power Set of a Set (1)
- N-SHG-edge (1)
- N-SHG-vertex (1)
- N-SuperHyperGraph (n-SHG) (1)
- N-ary AntiHyperAlgebra (1)
- N-ary AntiHyperAxiom (1)
- N-ary AntiHyperOperation (1)
- N-ary HyperAlgebra (1)
- N-ary HyperAxiom (1)
- N-ary HyperOperation (1)
- N-ary NeutroHyperAlgebra (1)
- N-ary NeutroHyperAxiom (1)
- N-ary NeutroHyperOperation (1)
- Neutro-BCK-algebra (1)
- Neutro-BE-algebra (1)
- Neutro-Hass diagram (1)
- Neutro-sophication (1)
- NeutroPoset (1)
- Plithogenic n-SuperHyperGraph (1)
- Post-quantum (1)
- Vortex formation length; wake; vortex shedding (1)
Articles 1 - 5 of 5
Full-Text Articles in Other Mathematics
Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya
Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
We examine two dimensional properties of vortex shedding past elliptical cylinders through numerical simulations. Specifically, we investigate the vortex formation length in the Reynolds number regime 10 to 100 for elliptical bodies of aspect ratio in the range 0.4 to 1.4. Our computations reveal that in the steady flow regime, the change in the vortex length follows a linear profile with respect to the Reynolds number, while in the unsteady regime, the time averaged vortex length decreases in an exponential manner with increasing Reynolds number. The transition in profile is used to identify the critical Reynolds number which marks the …
Extension Of Hypergraph To N-Superhypergraph And To Plithogenic N-Superhypergraph, And Extension Of Hyperalgebra To N-Ary (Classical-/Neutro-/Anti-)Hyperalgebra, Florentin Smarandache
Extension Of Hypergraph To N-Superhypergraph And To Plithogenic N-Superhypergraph, And Extension Of Hyperalgebra To N-Ary (Classical-/Neutro-/Anti-)Hyperalgebra, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
We recall and improve our 2019 concepts of n-Power Set of a Set, n-SuperHyperGraph, Plithogenic n-SuperHyperGraph, and n-ary HyperAlgebra, n-ary NeutroHyperAlgebra, n-ary AntiHyperAlgebra respectively, and we present several properties and examples connected with the real world.
On Neutro-Be-Algebras And Anti-Be-Algebras, Florentin Smarandache, Akbar Rezaei
On Neutro-Be-Algebras And Anti-Be-Algebras, Florentin Smarandache, Akbar Rezaei
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, the concepts of Neutro-BE-algebra and Anti-BE-algebra are introduced, and some related properties and four theorems are investigated. We show that the classes of Neutro-BE-algebra and Anti-BE-algebras are alternatives of the class of BE-algebras.
Neutro-Bck-Algebra, Florentin Smarandache, Mohammad Hamidi
Neutro-Bck-Algebra, Florentin Smarandache, Mohammad Hamidi
Branch Mathematics and Statistics Faculty and Staff Publications
This paper introduces the novel concept of Neutro-BCK-algebra. In Neutro-BCK-algebra, the outcome of any given two elements under an underlying operation (neutro-sophication procedure) has three cases, such as: appurtenance, non-appurtenance, or indeterminate. While for an axiom: equal, non-equal, or indeterminate. This study investigates the Neutro-BCK-algebra and shows that Neutro-BCK-algebra are different from BCK-algebra. The notation of Neutro-BCK-algebra generates a new concept of NeutroPoset and Neutro-Hass-diagram for NeutroPosets. Finally, we consider an instance of applications of the Neutro-BCK-algebra.
Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick
Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick
Senior Honors Theses
Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of them rely on problems, such as integer factorization, that are not resistant to quantum algorithms. With the reality of quantum computers approaching, it is critical that a quantum-resistant method of protecting information is found. After developing the proper background, we evaluate the potential of the McEliece cryptosystem for use in the post-quantum era by examining families of algebraic geometry codes that allow …