Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Algebra (76)
- Discrete Mathematics and Combinatorics (74)
- Applied Mathematics (44)
- Geometry and Topology (43)
- Number Theory (41)
-
- Computer Sciences (20)
- Other Mathematics (17)
- Analysis (14)
- Dynamical Systems (14)
- Algebraic Geometry (13)
- Theory and Algorithms (12)
- Partial Differential Equations (10)
- Numerical Analysis and Computation (8)
- Statistics and Probability (8)
- Information Security (7)
- Analytical, Diagnostic and Therapeutic Techniques and Equipment (4)
- Life Sciences (4)
- Medicine and Health Sciences (4)
- Other Applied Mathematics (4)
- Physics (4)
- Probability (4)
- Arts and Humanities (3)
- Numerical Analysis and Scientific Computing (3)
- Quantum Physics (3)
- Art and Design (2)
- Dynamic Systems (2)
- Engineering (2)
- Genetics and Genomics (2)
- Keyword
-
- Hyperbolic geometry (10)
- Tiling (10)
- Graph theory (9)
- Group Theory (9)
- Cryptography (8)
-
- Discrete logarithm (8)
- Tilings (7)
- Combinatorics (6)
- Cwatsets (5)
- Elliptic curve (5)
- Number theory (5)
- Cwatset (4)
- Discrete Logarithm (4)
- Graph (4)
- Inverse problems (4)
- Rewriteability in finite groups (4)
- Analysis (3)
- Finite Group Theory (3)
- Functional graphs (3)
- Hensel's lemma (3)
- Isoperimetric (3)
- Number Theory (3)
- Probability (3)
- Rewriteability (3)
- Riemann surface (3)
- Tesselation (3)
- Topology (3)
- 3-rewriteability (2)
- Algebraic Topology (2)
- Automorphism Group (2)
- Publication Year
- Publication
- Publication Type
Articles 121 - 150 of 254
Full-Text Articles in Mathematics
Graphs, Random Walks, And The Tower Of Hanoi, Stephanie Egler
Graphs, Random Walks, And The Tower Of Hanoi, Stephanie Egler
Rose-Hulman Undergraduate Mathematics Journal
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and computing. Typically used as a classroom example of the important phenomenon of recursion, the puzzle has also been intensively studied its own right, using graph theory, probability, and other tools. The subject of this paper is “Hanoi graphs”, that is, graphs that portray all the possible arrangements of the puzzle, together with all the possible moves from one arrangement to another. These graphs are not only fascinating in their own right, but they shed considerable light on the nature of the puzzle itself. …
Asymptotically Optimal Bounds For (𝑡,2) Broadcast Domination On Finite Grids, Timothy W. Randolph
Asymptotically Optimal Bounds For (𝑡,2) Broadcast Domination On Finite Grids, Timothy W. Randolph
Rose-Hulman Undergraduate Mathematics Journal
Let G = (V,E) be a graph and t,r be positive integers. The signal that a tower vertex T of signal strength t supplies to a vertex v is defined as sig(T, v) = max(t − dist(T,v),0), where dist(T,v) denotes the distance between the vertices v and T. In 2015 Blessing, Insko, Johnson, and Mauretour defined a (t, r) broadcast dominating set, or simply a (t, r) broadcast, on G as a set T ⊆ V such that the sum of all signal received at each vertex v ∈ V from the set of towers T …
New Experimental Investigations For The 3𝑥+1 Problem: The Binary Projection Of The Collatz Map, Benjamin Bairrington, Aaron Okano
New Experimental Investigations For The 3𝑥+1 Problem: The Binary Projection Of The Collatz Map, Benjamin Bairrington, Aaron Okano
Rose-Hulman Undergraduate Mathematics Journal
The 3x + 1 Problem, or the Collatz Conjecture, was originally developed in the early 1930's. It has remained unsolved for over eighty years. Throughout its history, traditional methods of mathematical problem solving have only succeeded in proving heuristic properties of the mapping. Because the problem has proven to be so difficult to solve, many think it might be undecidable. In this paper we brie y follow the history of the 3x + 1 problem from its creation in the 1930's to the modern day. Its history is tied into the development of the Cosper Algorithm, which maps binary sequences …
A Generalized Newton-Girard Identity, Tanay Wakhare
A Generalized Newton-Girard Identity, Tanay Wakhare
Rose-Hulman Undergraduate Mathematics Journal
We present a generalization of the Newton-Girard identities, along with some applications. As an addendum, we collect many evaluations of symmetric polynomials to which these identities apply.
Existence Of A Highest Wave In A Fully Dispersive Two-Way Shallow Water Model, Kyle Claassen, Matthew Johnson, Mats Ehrnstrom
Existence Of A Highest Wave In A Fully Dispersive Two-Way Shallow Water Model, Kyle Claassen, Matthew Johnson, Mats Ehrnstrom
Faculty Publications - Mathematics
No abstract provided.
Nondegeneracy And Stability Of Antiperiodic Bound States For Fractional Nonlinear Schrodinger Equations, Kyle Claassen, Matthew Johnson
Nondegeneracy And Stability Of Antiperiodic Bound States For Fractional Nonlinear Schrodinger Equations, Kyle Claassen, Matthew Johnson
Faculty Publications - Mathematics
No abstract provided.
Sums Involving The Number Of Distinct Prime Factors Function, Tanay Wakhare
Sums Involving The Number Of Distinct Prime Factors Function, Tanay Wakhare
Rose-Hulman Undergraduate Mathematics Journal
We find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria for these series. The approach of this paper is to use the theory of symmetric functions to derive identities for the elementary symmetric functions, then apply these identities to arbitrary primes and values of multiplicative functions evaluated at primes. This allows us to reinterpret sums over symmetric polynomials as divisor sums and sums over the natural numbers.
Partial Sum Trigonometric Identities And Chebyshev Polynomials, Sarah Weller
Partial Sum Trigonometric Identities And Chebyshev Polynomials, Sarah Weller
Rose-Hulman Undergraduate Mathematics Journal
Using Euler’s theorem, geometric sums and Chebyshev polynomials, we prove trigonometric identities involving sums and multiplications of cosine.
A Proof Of The "Magicness" Of The Siam Construction Of A Magic Square, Joshua Arroyo
A Proof Of The "Magicness" Of The Siam Construction Of A Magic Square, Joshua Arroyo
Rose-Hulman Undergraduate Mathematics Journal
A magic square is an n x n array filled with n2 distinct positive integers 1, 2, ..., n2 such that the sum of the n integers in each row, column, and each of the main diagonals are the same. A Latin square is an n x n array consisting of n distinct symbols such that each symbol appears exactly once in each row and column of the square. Many articles dealing with the construction of magic squares introduce the Siam method as a "simple'' construction for magic squares. Rarely, however, does the article actually prove that the …
On Orders Of Elliptic Curves Over Finite Fields, Yujin H. Kim, Jackson Bahr, Eric Neyman, Gregory Taylor
On Orders Of Elliptic Curves Over Finite Fields, Yujin H. Kim, Jackson Bahr, Eric Neyman, Gregory Taylor
Rose-Hulman Undergraduate Mathematics Journal
In this work, we completely characterize by $j$-invariant the number of orders of elliptic curves over all finite fields $F_{p^r}$ using combinatorial arguments and elementary number theory. Whenever possible, we state and prove exactly which orders can be taken on.
Stranded Cellular Automaton And Weaving Products, Hao Yang
Stranded Cellular Automaton And Weaving Products, Hao Yang
Mathematical Sciences Technical Reports (MSTR)
In order to analyze weaving products mathematically and find out valid weaving products, it is natural to relate them to Cellular Automaton. They are both generated based on specific rules and some initial conditions. Holden and Holden have created a Stranded Cellular Automaton that can represent common weaving and braiding products. Based on their previous findings, we were able to construct a Java program and analyze various aspects of the automaton they created. This paper will discuss the complexity of the Stranded Cellular Automaton, how to determine whether a weaving product holds together or not based on the automaton and …
Branching Matrices For The Automorphism Group Lattice Of A Riemann Surface, Sean A. Broughton
Branching Matrices For The Automorphism Group Lattice Of A Riemann Surface, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
Let S be a Riemann surface and G a large subgroup of Aut(S) (Aut(S) may be unknown). We are particularly interested in regular n-gonal surfaces, i.e., the quotient surface S/G (and hence S/Aut(S)) has genus zero. For various H the ramification information of the branched coverings S/K -> S/H may be captured in a matrix. The ramification information, in particular strong branching, may be then be used in analyzing the structure of Aut(S). The ramification information is conjugation invariant so the matrix's rows and columns may be indexed by conjugacy classes of subgroups. The only required …
The Convex Body Isoperimetric Conjecture In The Plane, John Berry, Eliot Bongiovanni, Wyatt Boyer, Bryan Brown, Paul Gallagher, David Hu, Alyssa Loving, Zane Martin, Maggie Miller, Byron Perpetua, Sarah Tammen
The Convex Body Isoperimetric Conjecture In The Plane, John Berry, Eliot Bongiovanni, Wyatt Boyer, Bryan Brown, Paul Gallagher, David Hu, Alyssa Loving, Zane Martin, Maggie Miller, Byron Perpetua, Sarah Tammen
Rose-Hulman Undergraduate Mathematics Journal
The Convex Body Isoperimetric Conjecture states that the least perimeter needed to enclose a volume within a ball is greater than the least perimeter needed to enclose the same volume within any other convex body of the same volume in Rn. We focus on the conjecture in the plane and prove a new sharp lower bound for the isoperimetric profile of the disk in this case. We prove the conjecture in the case of regular polygons, and show that in a general planar convex body the conjecture holds for small areas.
Limiting Absorption Principle And Strichartz Estimates For Dirac Operators In Two And Higher Dimensions, William Green, M Erdogan, Michael Goldberg
Limiting Absorption Principle And Strichartz Estimates For Dirac Operators In Two And Higher Dimensions, William Green, M Erdogan, Michael Goldberg
Faculty Publications - Mathematics
No abstract provided.
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Mathematical Sciences Technical Reports (MSTR)
The problem of exact polynomial factorization, in other words expressing a polynomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used …
Inverse Laplace Transform And Post Inversion Formula, Qinmao Zhang
Inverse Laplace Transform And Post Inversion Formula, Qinmao Zhang
Mathematical Sciences Technical Reports (MSTR)
This paper is dedicated to a general numerical approach to inverse Laplace transforms based on the Post Inversion Formula, which is a theoretical equivalent to the inverse Laplace transform. Though most approaches are too computationally intensive to be of practical use, we introduce an efficient algorithm to compute it based on the Parker-Sochacki method (PSM). This paper also contains some example MATLAB code and algorithm analysis.
Topological And Hq Equivalence Of Prime Cyclic P-Gonal Actions On Riemann Surfaces (Corrected), Sean A. Broughton
Topological And Hq Equivalence Of Prime Cyclic P-Gonal Actions On Riemann Surfaces (Corrected), Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
Two Riemann surfaces S1 and S2 with conformal G-actions have topologically equivalent actions if there is a homeomorphism h : S1 -> S2 which intertwines the actions. A weaker equivalence may be defined by comparing the representations of G on the spaces of holomorphic q-differentials Hq(S1) and Hq(S2). In this note we study the differences between topological equivalence and Hq equivalence of prime cyclic actions, where S1/G and S2/G have genus zero.
An Investigation Of Minimal Surfaces In So(3), Luke Bohn
An Investigation Of Minimal Surfaces In So(3), Luke Bohn
Rose-Hulman Undergraduate Research Publications
Classical minimal surface theory can be thought of as dealing with the shapes of soap films stretched across wires in Euclidean space R3. This article will examine such structures in an abstract three-dimensional space, the Lie Group SO(3). This is the space of possible rotations in R3, where each rotation is expressed as three angles: two to indicate the axis of rotation and one to indicate the amount of rotation. The properties of the space SO(3) may result in minimal surfaces that behave differently than they do in R3.
Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann
Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann
Mathematical Sciences Technical Reports (MSTR)
As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is thought that the functions that such schemes use have inverses that are computationally intractable. In relation to this, we are interested in counting the solutions to a generalization of the discrete logarithm problem modulo a prime power. This is achieved by interpolating to p-adic functions, and using Hensel's lemma, or other methods in the case of singular lifting, and the Chinese Remainder Theorem.
Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech
Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech
Mathematical Sciences Technical Reports (MSTR)
The increased use of cryptography to protect our personal information makes us want to understand the security of cryptosystems. The security of many cryptosystems relies on solving the discrete logarithm, which is thought to be relatively difficult. Therefore, we focus on the statistical analysis of certain properties of the graph of the discrete logarithm. We discovered the expected value and variance of a certain property of the graph and compare the expected value to experimental data. Our finding did not coincide with our intuition of the data following a Gaussian distribution given a large sample size. Thus, we found the …
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Mathematical Sciences Technical Reports (MSTR)
Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.
Quasi-Platonic Psl2(Q)-Actions On Closed Riemann Surfaces, Sean A. Broughton
Quasi-Platonic Psl2(Q)-Actions On Closed Riemann Surfaces, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
This paper is the first of two papers whose combined goal is to explore the dessins d'enfant and symmetries of quasi-platonic actions of PSL2(q). A quasi-platonic action of a group G on a closed Riemann S surface is a conformal action for which S/G is a sphere and S->S/G is branched over {0, 1,infinity}. The unit interval in S/G may be lifted to a dessin d'enfant D, an embedded bipartite graph in S. The dessin forms the edges and vertices of a tiling on S by dihedrally symmetric polygons, generalizing the idea of a …
Spontaneous Synchrony On Graphs And The Emergence Of Order From Disorder, Dylan Linville, Daniel Trugillo Martins Fontes
Spontaneous Synchrony On Graphs And The Emergence Of Order From Disorder, Dylan Linville, Daniel Trugillo Martins Fontes
Mathematical Sciences Technical Reports (MSTR)
From pulsars to pedestrians and bacteria to brain cells, objects that exhibit cyclical behavior, called oscillators, are found in a variety of different settings. When oscillators adjust their behavior in response to nearby oscillators, they often achieve a state of synchrony, in which they all have the same phase and frequency. Here, we explore the Kuramoto model, a simple and general model which describes oscillators as dynamical systems on a graph and has been used to study synchronization in systems ranging from firefly swarms to the power grid. We discuss analytical and numerical methods used to investigate the governing system …
Continuous Dependence Of Solutions Of Equations On Parameters, Sean A. Broughton
Continuous Dependence Of Solutions Of Equations On Parameters, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
It is shown under very general conditions that the solutions of equations depend continuously on the coefficients or parameters of the equations. The standard examples are solutions of monic polynomial equations and the eigenvalues of a matrix. However, the proof methods apply to any finite map T : Cn -> Cn.
Calculation Of The Killing Form Of A Simple Lie Group, Sean A. Broughton
Calculation Of The Killing Form Of A Simple Lie Group, Sean A. Broughton
Mathematical Sciences Technical Reports (MSTR)
The Killing form of a simple Lie Algebra is determined from invariants of the extended root diagrams of the Lie algebra.
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Mathematical Sciences Technical Reports (MSTR)
The Welch map x -> gx-1+c is similar to the discrete exponential map x -> gx, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: gx-1+c = x (mod pe) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo pe, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Rose-Hulman Undergraduate Research Publications
The Welch map x -> gx-1+c is similar to the discrete exponential map x -> gx, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: gx-1+c = x (mod pe) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo pe, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …
Fundamentals Of Protein Structure Alignment, Allen Holder, Mark Brandt, Yosi Shibberu
Fundamentals Of Protein Structure Alignment, Allen Holder, Mark Brandt, Yosi Shibberu
Mathematical Sciences Technical Reports (MSTR)
The central dogma of molecular biology asserts a one way transfer of information from a cell’s genetic code to the expression of proteins. Proteins are the functional workhorses of a cell, and studying these molecules is at the foundation of much of computational biology. Our goal here is to present a succinct introduction to the biological, mathematical, and computational aspects of making pairwise comparisons between protein structures. The presentation is intended to be useful for those who are entering this research area. The chapter begins with a brief introduction to the biology of protein comparison, which is followed by a …
The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans
The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans
Mathematical Sciences Technical Reports (MSTR)
The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve discrete logarithm problem (ECDLP) is an open problem in the field of number theory, and its applications to modern cryptographic algorithms are numerous. This paper focuses on a statistical analysis of a modification to the ECDLP, called the x-ECDLP, where one is only given the xcoordinate of a point, instead of the entire point. Focusing only on elliptic curves whose field of definition is smaller than the number of points, this paper attempts to find a statistical indication of underlying structure (or lack thereof) in the …
Structure And Randomness Of The Discrete Lambert Map, Jingjing Chen, Mark Lotts
Structure And Randomness Of The Discrete Lambert Map, Jingjing Chen, Mark Lotts
Mathematical Sciences Technical Reports (MSTR)
We investigate the structure and cryptographic applications of the Discrete Lambert Map (DLM). The mapping is closely related to the Discrete Log Problem, but has received far less attention since it is considered to be a more complicated map that is likely even harder to invert. However, this mapping is quite important because it underlies the security of the ElGamal Digital Signature Scheme. Using functional graphs induced by this mapping, we were able to find non-random properties that could potentially be used to exploit the ElGamal DSS.