Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Claremont Colleges (4)
- University of New Mexico (3)
- California Polytechnic State University, San Luis Obispo (2)
- Colby College (2)
- The University of Akron (2)
-
- University of Louisville (2)
- Arkansas Tech University (1)
- Brigham Young University (1)
- California State University, San Bernardino (1)
- City University of New York (CUNY) (1)
- Clemson University (1)
- Missouri State University (1)
- Old Dominion University (1)
- Rose-Hulman Institute of Technology (1)
- Syracuse University (1)
- United Arab Emirates University (1)
- University of Kentucky (1)
- Keyword
-
- Mathematics (3)
- Analysis (2)
- (Abstract Harmonic Analysis) Explicit machine computation and programs (not the theory of computation or programming) (1)
- 15A23 Factorization of matrices (1)
- 20C30 (1)
-
- 43-04 (1)
- 43A30 (1)
- 65F99 Numerical linear algebra (1)
- Abstract Algebra (1)
- Abstract algebra (1)
- Algebraic coding theory (1)
- Applied Math (1)
- Applied Mathematics (1)
- Assessment (1)
- Authentication (1)
- BCH Codes (1)
- Barcode (1)
- Bernoulli (1)
- Campanology (1)
- Category Theory (1)
- Cauchy's equation (1)
- Cayley graphs (1)
- Cayley's Theorem (1)
- Characterizing (1)
- Circular minor (1)
- Circular network (1)
- Circular pair (1)
- Circular planar (1)
- Conjectures (1)
- Convolution (1)
- Publication Year
- Publication
-
- Branch Mathematics and Statistics Faculty and Staff Publications (3)
- Electronic Theses and Dissertations (2)
- HMC Senior Theses (2)
- Honors Theses (2)
- Williams Honors College, Honors Research Projects (2)
-
- ATU Scholars Symposium (1)
- All Theses (1)
- CMC Senior Theses (1)
- Cybersecurity Undergraduate Research Showcase (1)
- Electronic Theses, Projects, and Dissertations (1)
- Emirates Journal for Engineering Research (1)
- Graduate Theses/Dissertations (1)
- Journal of Nonprofit Innovation (1)
- Master's Theses (1)
- Publications and Research (1)
- Renée Crown University Honors Thesis Projects - All (1)
- Rose-Hulman Undergraduate Mathematics Journal (1)
- STAR Program Research Presentations (1)
- The Transdisciplinary STEAM+ Journal (1)
- Theses and Dissertations--Mathematics (1)
- Publication Type
- File Type
Articles 1 - 26 of 26
Full-Text Articles in Algebra
A Categorical Framework For Modeling Genetic Drift, Taylor G. Mendes
A Categorical Framework For Modeling Genetic Drift, Taylor G. Mendes
Rose-Hulman Undergraduate Mathematics Journal
Genetic drift describes changes in allele frequencies that arise from chance sampling in finite populations. This paper develops a categorical framework for organizing the structural features of drift. Population states are modeled as objects, evolutionary transitions as morphisms, reversible transitions as groupoid morphisms, and structure-preserving comparisons between models as functors. Group actions are used to describe deterministic evolutionary operators such as mutation and selection, while orbits and fixed points identify reachable allele-frequency states and stable absorbing outcomes. Universal properties are then used to describe drift as a coherence condition connecting stochastic transitions with deterministic evolutionary maps. The resulting framework complements …
Learning With Errors Parameter Analysis, Archana Parameswaran
Learning With Errors Parameter Analysis, Archana Parameswaran
Cybersecurity Undergraduate Research Showcase
We implement a systematic approach for generating, evaluating, and benchmarking Learning with Errors implementations in Sage Math by varying lattice dimensions, moduli, error standard deviations, and multiple error distributions to observe concrete security-efficiency tradeoffs. The security estimator maps parameter sets to concrete security levels and bits, while performance metrics measured computational efficiency and memory requirements. Results indicate that various distribution types do not significantly impact security, though binomial distributions require more computational overhead than discrete gaussian or uniform. Memory requirements increased when modulus q increased from 12289 to 65537. Larger dimensions have an exponentially growing requirement for memory, but this …
Rsa Algorithm, Evalisbeth Garcia Diazbarriga
Rsa Algorithm, Evalisbeth Garcia Diazbarriga
ATU Scholars Symposium
I will be presenting about the RSA method in cryptology which is the coding and decoding of messages. My research will focus on proving that the method works and how it is used to communicate secretly.
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Journal of Nonprofit Innovation
Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.
Imagine Doris, who is …
Efficient And Secure Digital Signature Algorithm (Dsa), Nissa Mehibel, M'Hamed Hamadouche
Efficient And Secure Digital Signature Algorithm (Dsa), Nissa Mehibel, M'Hamed Hamadouche
Emirates Journal for Engineering Research
The digital signature is used to ensure the integrity of messages as well as the authentication and non-repudiation of users. Today it has a very important role in information security. Digital signature is used in various fields such as e-commerce and e-voting, health, internet of things (IOT). Many digital signature schemes have been proposed, depending on the computational cost and security level. In this paper, we analyzed a recently proposed digital signature scheme based on the discrete logarithm problem (DLP). Our analysis shows that the scheme is not secure against the repeated random number attack to determine the secret keys …
Stability Of Cauchy's Equation On Δ+., Holden Wells
Stability Of Cauchy's Equation On Δ+., Holden Wells
Electronic Theses and Dissertations
The most famous functional equation f(x+y)=f(x)+f(y) known as Cauchy's equation due to its appearance in the seminal analysis text Cours d'Analyse (Cauchy 1821), was used to understand fundamental aspects of the real numbers and the importance of regularity assumptions in mathematical analysis. Since then, the equation has been abstracted and examined in many contexts. One such examination, introduced by Stanislaw Ulam and furthered by Donald Hyers, was that of stability. Hyers demonstrated that Cauchy's equation exhibited stability over Banach Spaces in the following sense: functions that approximately satisfy Cauchy's equation are approximated with the same level of error by functions …
Efficiency Of Homomorphic Encryption Schemes, Kyle Yates
Efficiency Of Homomorphic Encryption Schemes, Kyle Yates
All Theses
In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …
Unique Signed Minimal Wiring Diagrams And The Stanley-Reisner Correspondence, Vanessa Newsome-Slade
Unique Signed Minimal Wiring Diagrams And The Stanley-Reisner Correspondence, Vanessa Newsome-Slade
Master's Theses
Biological systems are commonly represented using networks consisting of interactions between various elements in the system. Reverse engineering, a method of mathematical modeling, is used to recover how the elements in the biological network are connected. These connections are encoded using wiring diagrams, which are directed graphs that describe how elements in a network affect one another. A signed wiring diagram provides additional information about the interactions between elements relating to activation and inhibition. Due to cost concerns, it is optimal to gain insight into biological networks with as few experiments and data as possible. Minimal wiring diagrams identify the …
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Honors Theses
In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …
Representation Theory And Its Applications In Physics, Jakub Bystrický
Representation Theory And Its Applications In Physics, Jakub Bystrický
Honors Theses
Representation theory is a branch of mathematics that allows us to represent elements of a group as elements of a general linear group of a chosen vector space by means of a homomorphism. The group elements are mapped to linear operators and we can study the group using linear algebra. This ability is especially useful in physics where much of the theories are captured by linear algebra structures. This thesis reviews key concepts in representation theory of both finite and infinite groups. In the case of finite groups we discuss equivalence, orthogonality, characters, and group algebras. We discuss the importance …
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Williams Honors College, Honors Research Projects
In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Electronic Theses, Projects, and Dissertations
In Calculus we learned that Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …
Parametric Natura Morta, Maria C. Mannone
Parametric Natura Morta, Maria C. Mannone
The Transdisciplinary STEAM+ Journal
Parametric equations can also be used to draw fruits, shells, and a cornucopia of a mathematical still life. Simple mathematics allows the creation of a variety of shapes and visual artworks, and it can also constitute a pedagogical tool for students.
Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates
Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates
Electronic Theses and Dissertations
Ever since Shor's algorithm was introduced in 1994, cryptographers have been working to develop cryptosystems that can resist known quantum computer attacks. This push for quantum attack resistant schemes is known as post quantum cryptography. Specifically, my contributions to post quantum cryptography has been to the family of schemes known as Multivariate Public Key Cryptography (MPKC), which is a very attractive candidate for digital signature standardization in the post quantum collective for a wide variety of applications. In this document I will be providing all necessary background to fully understand MPKC and post quantum cryptography as a whole. Then, I …
Decoding Book Barcode Images, Yizhou Tao
Decoding Book Barcode Images, Yizhou Tao
CMC Senior Theses
This thesis investigated a method of barcode reconstruction to address the recovery of a blurred and convoluted one-dimensional barcode. There are a lot of types of barcodes used today, such as Code 39, Code 93, Code 128, etc. Our algorithm applies to the universal barcode, EAN 13. We extend the methodologies proposed by Iwen et al. (2013) in the journal article "A Symbol-Based Algorithm for Decoding barcodes." The algorithm proposed in the paper requires a signal measured by a laser scanner as an input. The observed signal is modeled as a true signal corrupted by a Gaussian convolution, additional noises, …
Cayley Graphs Of Groups And Their Applications, Anna Tripi
Cayley Graphs Of Groups And Their Applications, Anna Tripi
Graduate Theses/Dissertations
Cayley graphs are graphs associated to a group and a set of generators for that group (there is also an associated directed graph). The purpose of this study was to examine multiple examples of Cayley graphs through group theory, graph theory, and applications. We gave background material on groups and graphs and gave numerous examples of Cayley graphs and digraphs. This helped investigate the conjecture that the Cayley graph of any group (except Z_2) is hamiltonian. We found the conjecture to still be open. We found Cayley graphs and hamiltonian cycles could be applied to campanology (in particular, to the …
Multiple Problem-Solving Strategies Provide Insight Into Students’ Understanding Of Open-Ended Linear Programming Problems, Marla A. Sole
Multiple Problem-Solving Strategies Provide Insight Into Students’ Understanding Of Open-Ended Linear Programming Problems, Marla A. Sole
Publications and Research
Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students’ unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex, familiar solution strategies rather than simpler, more intuitive strategies, which suggests that students might need more experience working with informal solution methods. During the semester, by incorporating open-ended questions, I gained valuable feedback, was able to better model real-world problems, challenge students with different abilities, and strengthen students’ problem solving skills.
Subgroups Of Finite Wreath Product Groups For P=3, Jessica L. Gonda
Subgroups Of Finite Wreath Product Groups For P=3, Jessica L. Gonda
Williams Honors College, Honors Research Projects
Let M be the additive abelian group of 3-by-3 matrices whose entries are from the ring of integers modulo 9. The problem of determining all the normal subgroups of the regular wreath product group P=Z9≀(Z3 × Z3) that are contained in its base subgroup is equivalent to the problem of determining the subgroups of M that are invariant under two particular endomorphisms of M. In this thesis we give a partial solution to the latter problem by implementing a systematic approach using concepts from group theory and linear algebra.
Analysis And Constructions Of Subspace Codes, Carolyn E. Troha
Analysis And Constructions Of Subspace Codes, Carolyn E. Troha
Theses and Dissertations--Mathematics
Random network coding is the most effcient way to send data across a network, but it is very susceptible to errors and erasures. In 2008, Kotter and Kschischang introduced subspace codes as an algebraic approach to error correcting in random network coding. Since this paper, there has been much work in constructing large subspace codes, as well as exploring the properties of such codes. This dissertation explores properties of one particular construction and introduces a new construction for subspace codes. We begin by exploring properties of irreducible cyclic orbit codes, which were introduced in 2011 by Rosenthal et al. As …
Fast Algorithms For Analyzing Partially Ranked Data, Matthew Mcdermott
Fast Algorithms For Analyzing Partially Ranked Data, Matthew Mcdermott
HMC Senior Theses
Imagine your local creamery administers a survey asking their patrons to choose their five favorite ice cream flavors. Any data collected by this survey would be an example of partially ranked data, as the set of all possible flavors is only ranked into subsets of the chosen flavors and the non-chosen flavors. If the creamery asks you to help analyze this data, what approaches could you take? One approach is to use the natural symmetries of the underlying data space to decompose any data set into smaller parts that can be more easily understood. In this work, I describe …
Characterization Of The Drilling Via The Vibration Augmenter Of Rotary-Drills And Sound Signal Processing Of Impacted Pipe As A Potential Water Height Assessment Tool, Nicholas Morris
STAR Program Research Presentations
The focus of the internship has been on two topics: a) Characterize the drilling performance of a novel percussive augmenter – this drill was developed by the JPL’s Advanced Technologies Group and its performance was characterized; and b) Examine the feasibility of striking a pipe as a means of assessing the water height inside the pipe. The purpose of this investigation is to examine the possibility of using a simple method of applying impacts to a pipe wall and determining the water height from the sonic characteristic differences including damping, resonance frequencies, etc. Due to multiple variables that are relevant …
Structured Matrices And The Algebra Of Displacement Operators, Ryan Takahashi
Structured Matrices And The Algebra Of Displacement Operators, Ryan Takahashi
HMC Senior Theses
Matrix calculations underlie countless problems in science, mathematics, and engineering. When the involved matrices are highly structured, displacement operators can be used to accelerate fundamental operations such as matrix-vector multiplication. In this thesis, we provide an introduction to the theory of displacement operators and study the interplay between displacement and natural matrix constructions involving direct sums, Kronecker products, and blocking. We also investigate the algebraic behavior of displacement operators, developing results about invertibility and kernels.
Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy
Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of supermatrices of refined labels. Authors prove super row matrix of refined labels form a group under addition. However super row matrix of refined labels do not form a group under product; it only forms a semigroup under multiplication. In this book super column matrix of refined labels and m × n matrix of refined labels are introduced and studied. We mainly study this to introduce to super vector space of refined labels using matrices. We in this book introduce the notion of semifield of refined labels using which …
Analyzing Fractals, Kara Mesznik
Analyzing Fractals, Kara Mesznik
Renée Crown University Honors Thesis Projects - All
For my capstone project, I analyzed fractals. A fractal is a picture that is composed of smaller images of the larger picture. Each smaller picture is self- similar, meaning that each of these smaller pictures is actually the larger image just contracted in size through the use of the Contraction Mapping Theorem and shifted using linear and affine transformations.
Fractals live in something called a metric space. A metric space, denoted (X, d), is a space along with a distance formula used to measure the distance between elements in the space. When producing fractals …
A Unifying Field In Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability And Statistics - 6th Ed., Florentin Smarandache
A Unifying Field In Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability And Statistics - 6th Ed., Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
It was a surprise for me when in 1995 I received a manuscript from the mathematician, experimental writer and innovative painter Florentin Smarandache, especially because the treated subject was of philosophy - revealing paradoxes - and logics. He had generalized the fuzzy logic, and introduced two new concepts: a) “neutrosophy” – study of neutralities as an extension of dialectics; b) and its derivative “neutrosophic”, such as “neutrosophic logic”, “neutrosophic set”, “neutrosophic probability”, and “neutrosophic statistics” and thus opening new ways of research in four fields: philosophy, logics, set theory, and probability/statistics. It was known to me his setting up in …
Sequences Of Numbers Involved In Unsolved Problems, Florentin Smarandache
Sequences Of Numbers Involved In Unsolved Problems, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Here it is a long list of sequences, functions, unsolved problems, conjectures, theorems, relationships, operations, etc. Some of them are inter-connected. 1) Consecutive Sequence: 1,12,123,1234,12345,123456,1234567,12345678,123456789,12345678910, 1234567891011,123456789101112,12345678910111213,... How many primes are there among these numbers? In a general form, the Consecutive Sequence is considered in an arbitrary numeration base B.
References:
Student Conference, University of Craiova, Department of Mathematics, April 1979, "Some problems in number theory" by Florentin Smarandache.
Arizona State University, Hayden Library, "The Florentin Smarandache papers" special collection, Tempe, AZ 85287-1006, USA.
The Encyclopedia of Integer Sequences", by N. J. A. Sloane and S. Plouffe, Academic Press, San Diego, …