Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Analysis (2)
- 2-player Game (1)
- Algebraic Number Theory (1)
- Algebraic curvature tensor (1)
- Calculus (1)
-
- Cellular Automata (1)
- Combinatorics (1)
- Concavity (1)
- Constant sectional curvature (1)
- Constant vector curvature (1)
- Derivative (1)
- Directed (1)
- Directed Graph (1)
- Dirichlet problem (1)
- Double bubble (1)
- Dynamical Systems (1)
- Dynamics (1)
- Entropy (1)
- Error-correcting Codes (1)
- Euclidean buildings (1)
- Fractals (1)
- Galois Theory (1)
- Geometric Game (1)
- Graph (1)
- Graph labeling (1)
- Graph theory (1)
- Green's function (1)
- Group actions (1)
- Hilbert metric (1)
- Historical Mathematics (1)
- Publication
- Publication Type
Articles 1 - 25 of 25
Full-Text Articles in Physical Sciences and Mathematics
Decomposable Model Spaces And A Topological Approach To Curvature, Kevin M. Tully
Decomposable Model Spaces And A Topological Approach To Curvature, Kevin M. Tully
Rose-Hulman Undergraduate Mathematics Journal
This research investigates a model space invariant known as k-plane constant vector curvature, traditionally studied when k=2, and introduces a new invariant, (m,k)-plane constant vector curvature. We prove that the sets of k-plane and (m,k)-plane constant vector curvature values are connected, compact subsets of the real numbers and establish several relationships between the curvature values of a decomposable model space and its component spaces. We also prove that every decomposable model space with a positive-definite inner product has k-plane constant vector curvature for some integer k>1. In …
Winning Strategy For Multiplayer And Multialliance Geometric Game, Jingkai Ye
Winning Strategy For Multiplayer And Multialliance Geometric Game, Jingkai Ye
Rose-Hulman Undergraduate Mathematics Journal
The Geometric Sequence with common ratio 2 is one of the most well-known geometric sequences. Every term is a nonnegative power of 2. Using this popular sequence, we can create a Geometric Game which contains combining moves (combining two copies of the same terms into the one copy of next term) and splitting moves (splitting three copies of the same term into two copies of previous terms and one copy of the next term). For this Geometric Game, we are able to prove that the game is finite and the final game state is unique. Furthermore, we are able to …
Hurwitz Actions On Reflection Factorizations In Complex Reflection Group G₆, Gaurav Gawankar, Dounia Lazreq, Mehr Rai, Seth Sabar
Hurwitz Actions On Reflection Factorizations In Complex Reflection Group G₆, Gaurav Gawankar, Dounia Lazreq, Mehr Rai, Seth Sabar
Rose-Hulman Undergraduate Mathematics Journal
We show that in the complex reflection group G6, reflection factorizations of a Coxeter element that have the same length and multiset of conjugacy classes are in the same Hurwitz orbit. This confirms one case of a conjecture of Lewis and Reiner.
Lie-Derivations Of Three-Dimensional Non-Lie Leibniz Algebras, Emily H. Belanger
Lie-Derivations Of Three-Dimensional Non-Lie Leibniz Algebras, Emily H. Belanger
Rose-Hulman Undergraduate Mathematics Journal
The concept of Lie-derivation was recently introduced as a generalization of the notion of derivations for non-Lie Leibniz algebras. In this project, we determine the Lie algebras of Lie-derivations of all three-dimensional non-Lie Leibniz algebras. As a result of our calculations, we make conjectures on the basis of the Lie algebra of derivations of Lie-solvable non-Lie Leibniz algebras.
The Optimal Double Bubble For Density 𝑟ᵖ, Jack Hirsch, Kevin Li, Jackson Petty, Christopher Xue
The Optimal Double Bubble For Density 𝑟ᵖ, Jack Hirsch, Kevin Li, Jackson Petty, Christopher Xue
Rose-Hulman Undergraduate Mathematics Journal
In 2008 Reichardt proved that the optimal Euclidean double bubble---the least-perimeter way to enclose and separate two given volumes---is three spherical caps meeting along a sphere at 120 degrees. We consider Rn with density rp, joining the surge of research on manifolds with density after their appearance in Perelman's 2006 proof of the Poincaré Conjecture. Boyer et al. proved that the best single bubble is a sphere through the origin. We conjecture that the best double bubble is the Euclidean solution with the singular sphere passing through the origin, for which we have verified equilibrium (first variation …
A Proof Of A Generalization Of Niven's Theorem Using Algebraic Number Theory, Caroline Nunn
A Proof Of A Generalization Of Niven's Theorem Using Algebraic Number Theory, Caroline Nunn
Rose-Hulman Undergraduate Mathematics Journal
Niven’s theorem states that the sine, cosine, and tangent functions are rational for only a few rational multiples of π. Specifically, for angles θ that are rational multiples of π, the only rational values of sin(θ) and cos(θ) are 0, ±½, and ±1. For tangent, the only rational values are 0 and ±1. We present a proof of this fact, along with a generalization, using the structure of ideals in imaginary quadratic rings. We first show that the theorem holds for the tangent function using elementary properties of Gaussian integers, before extending the approach to other imaginary quadratic rings. We …
Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu
Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu
Mathematical Sciences Technical Reports (MSTR)
Molina and Watrous present a variation of the method to simulate a quantum Turing machine employed in Yao’s 1995 publication “Quantum Circuit Complexity”. We use a computer program to implement their method with linear algebra and an additional unitary operator defined to complete the details. Their method is verified to be correct on a quantum Turing machine.
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Mathematical Sciences Technical Reports (MSTR)
Hash functions map data of arbitrary length to data of predetermined length. Good hash functions are hard to predict, making them useful in cryptography. We are interested in the elliptic curve CGL hash function, which maps a bitstring to an elliptic curve by traversing an inputdetermined path through an isogeny graph. The nodes of an isogeny graph are elliptic curves, and the edges are special maps betwixt elliptic curves called isogenies. Knowing which hash values are most likely informs us of potential security weaknesses in the hash function. We use stochastic matrices to compute the expected probability distributions of the …
Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern
Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern
Rose-Hulman Undergraduate Mathematics Journal
In 2015, I. Rivin introduced an effective method to bound the number of irreducible integral polynomials with fixed degree d and height at most N. In this paper, we give a brief summary of this result and discuss the precision of Rivin's arguments for special classes of polynomials. We also give elementary proofs of classic results on Galois groups of cubic trinomials.
Lebesgue Measure Preserving Thompson Monoid And Its Properties Of Decomposition And Generators, William Li
Lebesgue Measure Preserving Thompson Monoid And Its Properties Of Decomposition And Generators, William Li
Rose-Hulman Undergraduate Mathematics Journal
This paper defines the Lebesgue measure preserving Thompson monoid, denoted by G, which is modeled on the Thompson group F except that the elements of G preserve the Lebesgue measure and can be non-invertible. The paper shows that any element of the monoid G is the composition of a finite number of basic elements of the monoid G and the generators of the Thompson group F. However, unlike the Thompson group F, the monoid G is not finitely generated. The paper then defines equivalence classes of the monoid G, use them to construct a monoid H …
Repeat Length Of Patterns On Weaving Products, Zhuochen Liu
Repeat Length Of Patterns On Weaving Products, Zhuochen Liu
Rose-Hulman Undergraduate Mathematics Journal
On weaving products such as fabrics and silk, people use interlacing strands to create artistic patterns. Repeated patterns form aesthetically pleasing products. This research is a mathematical modeling of weaving products in the real world by using cellular automata. The research is conducted by observing the evolution of the model to better understand products in the real world. Specifically, this research focuses on the repeat length of a weaving pattern given the rule of generating it and the configuration of the starting row. Previous studies have shown the range of the repeat length in specific situations. This paper will generalize …
Disjointness Of Linear Fractional Actions On Serre Trees, Henry W. Talbott
Disjointness Of Linear Fractional Actions On Serre Trees, Henry W. Talbott
Rose-Hulman Undergraduate Mathematics Journal
Serre showed that, for a discrete valuation field, the group of linear fractional transformations acts on an infinite regular tree with vertex degree determined by the residue degree of the field. Since the p-adics and the polynomials over the finite field of order p act on isomorphic trees, we may ask whether pairs of actions from these two groups are ever conjugate as tree automorphisms. We analyze permutations induced on finite vertex sets, and show a permutation classification result for actions by these linear fractional transformation groups. We prove that actions by specific subgroups of these groups are conjugate only …
New Results On Subtractive Magic Graphs, Matthew J. Ko, Jason Pinto, Aaron Davis
New Results On Subtractive Magic Graphs, Matthew J. Ko, Jason Pinto, Aaron Davis
Rose-Hulman Undergraduate Mathematics Journal
For any edge xy in a directed graph, the subtractive edge-weight is the sum of the label of xy and the label of y minus the label of x. Similarly, for any vertex z in a directed graph, the subtractive vertex-weight of z is the sum of the label of z and all edges directed into z and all the labels of edges that are directed away from z. A subtractive magic graph has every subtractive edge and vertex weight equal to some constant k. In this paper, we will discuss variations of subtractive magic labelings on …
Directed Graphs Of The Finite Tropical Semiring, Caden G. Zonnefeld
Directed Graphs Of The Finite Tropical Semiring, Caden G. Zonnefeld
Rose-Hulman Undergraduate Mathematics Journal
The focus of this paper lies at the intersection of the fields of tropical algebra and graph theory. In particular the interaction between tropical semirings and directed graphs is investigated. Originally studied by Lipvoski, the directed graph of a ring is useful in identifying properties within the algebraic structure of a ring. This work builds off research completed by Beyer and Fields, Hausken and Skinner, and Ang and Shulte in constructing directed graphs from rings. However, we will investigate the relationship (x, y)→(min(x, y), x+y) as defined by the operations of tropical algebra and applied to tropical semirings.
The Degeneration Of The Hilbert Metric On Ideal Pants And Its Application To Entropy, Marianne Debrito, Andrew Nguyen, Marisa O'Gara
The Degeneration Of The Hilbert Metric On Ideal Pants And Its Application To Entropy, Marianne Debrito, Andrew Nguyen, Marisa O'Gara
Rose-Hulman Undergraduate Mathematics Journal
Entropy is a single value that captures the complexity of a group action on a metric space. We are interested in the entropies of a family of ideal pants groups $\Gamma_T$, represented by projective reflection matrices depending on a real parameter $T > 0$. These groups act on convex sets $\Omega_{\Gamma_T}$ which form a metric space with the Hilbert metric. It is known that entropy of $\Gamma_T$ takes values in the interval $\left(\frac{1}{2},1\right]$; however, it has not been proven whether $\frac{1}{2}$ is the sharp lower bound. Using Python programming, we generate approximations of tilings of the convex set in the projective …
An Introduction To Fractal Analysis, Lucas Yong
An Introduction To Fractal Analysis, Lucas Yong
Rose-Hulman Undergraduate Mathematics Journal
Classical analysis is not able to treat functions whose domain is fractal. We present an introduction to analysis on a particular class of fractals known as post-critically finite (PCF) self-similar sets that is suitable for the undergraduate reader. We develop discrete approximations of PCF self-similar sets, and construct discrete Dirichlet forms and corresponding discrete Laplacians that both preserve self-similarity and are compatible with a notion of harmonic functions that is analogous to a classical setting. By taking the limit of these discrete Laplacians, we construct continuous Laplacians on PCF self-similar sets. With respect to this continuous Laplacian, we also construct …
Irrational Philosophy? Kronecker's Constructive Philosophy And Finding The Real Roots Of A Polynomial, Richard B. Schneider
Irrational Philosophy? Kronecker's Constructive Philosophy And Finding The Real Roots Of A Polynomial, Richard B. Schneider
Rose-Hulman Undergraduate Mathematics Journal
The prominent mathematician Leopold Kronecker (1823 – 1891) is often relegated to footnotes and mainly remembered for his strict philosophical position on the foundation of mathematics. He held that only the natural numbers are intuitive, thus the only basis for all mathematical objects. In fact, Kronecker developed a complete school of thought on mathematical foundations and wrote many significant algebraic works, but his enigmatic writing style led to his historical marginalization. In 1887, Kronecker published an extended version of his paper, “On the Concept of Number,” translated into English in 2010 for the first time by Edward T. Dean, who …
Compare And Contrast Maximum Likelihood Method And Inverse Probability Weighting Method In Missing Data Analysis, Scott Sun
Mathematical Sciences Technical Reports (MSTR)
Data can be lost for different reasons, but sometimes the missingness is a part of the data collection process. Unbiased and efficient estimation of the parameters governing the response mean model requires the missing data to be appropriately addressed. This paper compares and contrasts the Maximum Likelihood and Inverse Probability Weighting estimators in an Outcome-Dependendent Sampling design that deliberately generates incomplete observations. WE demonstrate the comparison through numerical simulations under varied conditions: different coefficient of determination, and whether or not the mean model is misspecified.
Numerical Integration Through Concavity Analysis, Daniel J. Pietz
Numerical Integration Through Concavity Analysis, Daniel J. Pietz
Rose-Hulman Undergraduate Mathematics Journal
We introduce a relationship between the concavity of a C2 func- tion and the area bounded by its graph and secant line. We utilize this relationship to develop a method of numerical integration. We then bound the error of the approximation, and compare to known methods, finding an improvement in error bound over methods of comparable computational complexity.
Exponents Of Jacobians Of Graphs And Regular Matroids, Hahn Lheem, Deyuan Li, Carl Joshua Quines, Jessica Zhang
Exponents Of Jacobians Of Graphs And Regular Matroids, Hahn Lheem, Deyuan Li, Carl Joshua Quines, Jessica Zhang
Rose-Hulman Undergraduate Mathematics Journal
Let G be a finite undirected multigraph with no self-loops. The Jacobian Jac (G) is a finite abelian group associated with G whose cardinality is equal to the number of spanning trees of G. There are only a finite number of biconnected graphs G such that the exponent of Jac (G) equals 2 or 3. The definition of a Jacobian can also be extended to regular matroids as a generalization of graphs. We prove that there are finitely many connected regular matroids M such that Jac (M) has exponent 2 and characterize all such matroids.
Gordian Adjacency For Positive Braid Knots, Tolson H. Bell, David C. Luo, Luke Seaton, Samuel P. Serra
Gordian Adjacency For Positive Braid Knots, Tolson H. Bell, David C. Luo, Luke Seaton, Samuel P. Serra
Rose-Hulman Undergraduate Mathematics Journal
A knot $K_1$ is said to be Gordian adjacent to a knot $K_2$ if $K_1$ is an intermediate knot on an unknotting sequence of $K_2$. We extend previous results on Gordian adjacency by showing sufficient conditions for Gordian adjacency between classes of positive braid knots through manipulations of braid words. In addition, we explore unknotting sequences of positive braid knots and give a proof that there are only finitely many positive braid knots for a given unknotting number.
Linear Combinations Of Harmonic Univalent Mappings, Dennis Nguyen
Linear Combinations Of Harmonic Univalent Mappings, Dennis Nguyen
Rose-Hulman Undergraduate Mathematics Journal
Many properties are known about analytic functions, however the class of harmonic functions which are the sum of an analytic function and the conjugate of an analytic function is less understood. We wish to find conditions such that linear combinations of univalent harmonic functions are univalent. We focus on functions whose image is convex in one direction i.e. each line segment in that direction between points in the image is contained in the image. M. Dorff proved sufficient conditions such that the linear combination of univalent harmonic functions will be univalent on the unit disk. The conditions are: the mappings …
A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian
A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian
Rose-Hulman Undergraduate Mathematics Journal
Artin’s Primitive Root Conjecture represents one of many famous problems in elementary number theory that has resisted complete solution thus far. Significant progress was made in 1967, when Christopher Hooley published a conditional proof of the conjecture under the assumption of a certain case of the Generalised Riemann Hypothesis. In this survey we present a description of the conjecture and the underlying algebraic theory, and provide a detailed account of Hooley’s proof which is intended to be accessible to those with only undergraduate level knowledge. We also discuss a result concerning the qx+1 problem, whose proof requires similar techniques to …
A Card Trick Based On Error-Correcting Codes, Luis A. Perez
A Card Trick Based On Error-Correcting Codes, Luis A. Perez
Rose-Hulman Undergraduate Mathematics Journal
Error-correcting codes (ECC), found in coding theory, use methods to handle possible errors that may arise from electronic noise, to a scratch of a CD in a way where they are detected and corrected. Recently, ECC have gone beyond their traditional use. ECC can be used in applications from performing magic tricks to detecting and repairing mutations in DNA sequencing. This paper investigates an application of the Hamming Code, a type of ECC, in the form of a magic trick which uses Andy Liu's description of the Hamming Code through set theory and a known card trick. Finally, connections between …
Mathematical Magic: A Study Of Number Puzzles, Nicasio M. Velez
Mathematical Magic: A Study Of Number Puzzles, Nicasio M. Velez
Rose-Hulman Undergraduate Mathematics Journal
Within this paper, we will briefly review the history of a collection of number puzzles which take the shape of squares, polygons, and polyhedra in both modular and nonmodular arithmetic. Among other results, we develop construction techniques for solutions of both Modulo and regular Magic Squares. For other polygons in nonmodular arithmetic, specifically of order 3, we present a proof of why there are only four Magic Triangles using linear algebra, disprove the existence of the Magic Tetrahedron in two ways, and utilizing the infamous 3-SUM combinatorics problem we disprove the existence of the Magic Octahedron.