Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Hyperbolic geometry (10)
- Group Theory (9)
- Tiling (9)
- Cryptography (8)
- Discrete logarithm (8)
-
- Graph theory (7)
- Tilings (7)
- Cwatsets (5)
- Number theory (5)
- Combinatorics (4)
- Cwatset (4)
- Discrete Logarithm (4)
- Elliptic curve (4)
- Graph (4)
- Inverse problems (4)
- Rewriteability in finite groups (4)
- Finite Group Theory (3)
- Functional graphs (3)
- Hensel's lemma (3)
- Isoperimetric (3)
- Probability (3)
- Rewriteability (3)
- Riemann surface (3)
- Tesselation (3)
- 3-rewriteability (2)
- Analysis (2)
- Automorphism Group (2)
- Automorphism group (2)
- Branched cover (2)
- Cellular Automata (2)
- Publication Year
- Publication
- Publication Type
- File Type
Articles 1 - 30 of 230
Full-Text Articles in Physical Sciences and Mathematics
The Basel Problem And Summing Rational Functions Over Integers, Pranjal Jain
The Basel Problem And Summing Rational Functions Over Integers, Pranjal Jain
Rose-Hulman Undergraduate Mathematics Journal
We provide a general method to evaluate convergent sums of the form ∑_{k∈Z} R(k) where R is a rational function with complex coefficients. The method is entirely elementary and does not require any calculus beyond some standard limits and convergence criteria. It is inspired by a geometric solution to the famous Basel Problem given by Wästlund (2010), so we begin by demonstrating the method on the Basel Problem to serve as a pilot application. We conclude by applying our ideas to prove Euler’s factorisation for sin x which he originally used to solve the Basel Problem.
Wang Tilings In Arbitrary Dimensions, Ian Tassin
Wang Tilings In Arbitrary Dimensions, Ian Tassin
Rose-Hulman Undergraduate Mathematics Journal
This paper makes a new observation about arbitrary dimensional Wang Tilings,
demonstrating that any d -dimensional tile set that can tile periodically along d − 1 axes must be able to tile periodically along all axes.
This work also summarizes work on Wang Tiles up to the present day, including
definitions for various aspects of Wang Tilings such as periodicity and the validity of a tiling. Additionally, we extend the familiar 2D definitions for Wang Tiles and associated properties into arbitrary dimensional spaces. While there has been previous discussion of arbitrary dimensional Wang Tiles in other works, it has been …
Optimizing Buying Strategies In Dominion, Nikolas A. Koutroulakis
Optimizing Buying Strategies In Dominion, Nikolas A. Koutroulakis
Rose-Hulman Undergraduate Mathematics Journal
Dominion is a deck-building card game that simulates competing lords growing their kingdoms. Here we wish to optimize a strategy called Big Money by modeling the game as a Markov chain and utilizing the associated transition matrices to simulate the game. We provide additional analysis of a variation on this strategy known as Big Money Terminal Draw. Our results show that player's should prioritize buying provinces over improving their deck. Furthermore, we derive heuristics to guide a player's decision making for a Big Money Terminal Draw Deck. In particular, we show that buying a second Smithy is always more optimal …
On The Singular Pebbling Number Of A Graph, Harmony R. Morris
On The Singular Pebbling Number Of A Graph, Harmony R. Morris
Rose-Hulman Undergraduate Mathematics Journal
In this paper, we define a new parameter of a connected graph as a spin-off of the pebbling number (which is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble). This new parameter is the singular pebbling number, the smallest t such that a player can be given any configuration of at least t pebbles and any target vertex and can successfully move pebbles so that exactly one pebble ends on the target vertex. We also prove that the singular pebbling number of any graph on 3 or more vertices is equal …
Eigenvalue Algorithm For Hausdorff Dimension On Complex Kleinian Groups, Jacob Linden, Xuqing Wu
Eigenvalue Algorithm For Hausdorff Dimension On Complex Kleinian Groups, Jacob Linden, Xuqing Wu
Rose-Hulman Undergraduate Mathematics Journal
In this manuscript, we present computational results approximating the Hausdorff dimension for the limit sets of complex Kleinian groups. We apply McMullen's eigenvalue algorithm \cite{mcmullen} in symmetric and non-symmetric examples of complex Kleinian groups, arising in both real and complex hyperbolic space. Numerical results are compared with asymptotic estimates in each case. Python code used to obtain all results and figures can be found at \url{https://github.com/WXML-HausDim/WXML-project}, all of which took only minutes to run on a personal computer.
Further Generalizations Of Happy Numbers, E. Simonton Williams
Further Generalizations Of Happy Numbers, E. Simonton Williams
Rose-Hulman Undergraduate Mathematics Journal
A positive integer n is defined to be happy if iteration of the function taking the sum of the squares of the digits of n eventually reaches 1. In this paper we generalize the concept of happy numbers in several ways. First we confirm known results of Grundman and Teeple and establish further results extending the known structure of happy numbers to higher powers. Then we construct a similar function expanding the definition of happy numbers to negative integers. Working with this function, we prove a range of results paralleling those already proven for traditional and generalized happy numbers. Finally, …
Divisibility Probabilities For Products Of Randomly Chosen Integers, Noah Y. Fine
Divisibility Probabilities For Products Of Randomly Chosen Integers, Noah Y. Fine
Rose-Hulman Undergraduate Mathematics Journal
We find a formula for the probability that the product of n positive integers, chosen at random, is divisible by some integer d. We do this via an inductive application of the Chinese Remainder Theorem, generating functions, and several other combinatorial arguments. Additionally, we apply this formula to find a unique, but slow, probabilistic primality test.
Elliptic Triangles Which Are Congruent To Their Polar Triangles, Jarrad S. Epkey, Morgan Nissen, Noelle K. Kaminski, Kelsey R. Hall, Nicholas Grabill
Elliptic Triangles Which Are Congruent To Their Polar Triangles, Jarrad S. Epkey, Morgan Nissen, Noelle K. Kaminski, Kelsey R. Hall, Nicholas Grabill
Rose-Hulman Undergraduate Mathematics Journal
We prove that an elliptic triangle is congruent to its polar triangle if and only if six specific Wallace-Simson lines of the triangle are concurrent. (If a point projected onto a triangle has the three feet of its projections collinear, that line is called a Wallace-Simson line.) These six lines would be concurrent at the orthocenter. The six lines come from projecting a vertex of either triangle onto the given triangle. We describe how to construct such triangles and a dozen Wallace-Simson lines.
Structure Of A Total Independent Set, Lewis Stanton
Structure Of A Total Independent Set, Lewis Stanton
Rose-Hulman Undergraduate Mathematics Journal
Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha''(G)$ respectively. This paper establishes an upper bound for $\alpha''(G)$ in terms of $\alpha(G)$, $\alpha'(G)$ and $n$. We also describe the possible structures for a total independent set containing a given number of elements.
K-Distinct Lattice Paths, Eric J. Yager, Marcus Engstrom
K-Distinct Lattice Paths, Eric J. Yager, Marcus Engstrom
Rose-Hulman Undergraduate Mathematics Journal
Lattice paths can be used to model scheduling and routing problems, and, therefore, identifying maximum sets of k-distinct paths is of general interest. We extend the work previously done by Gillman et. al. to determine the order of a maximum set of k-distinct lattice paths. In particular, we disprove a conjecture by Gillman that a greedy algorithm gives this maximum order and also refine an upper bound given by Brewer et. al. We illustrate that brute force is an inefficient method to determine the maximum order, as it has time complexity O(nk).
Utilizing Graph Thickness Heuristics On The Earth-Moon Problem, Robert C. Weaver
Utilizing Graph Thickness Heuristics On The Earth-Moon Problem, Robert C. Weaver
Rose-Hulman Undergraduate Mathematics Journal
This paper utilizes heuristic algorithms for determining graph thickness in order to attempt to find a 10-chromatic thickness-2 graph. Doing so would eliminate 9 colors as a potential solution to the Earth-moon Problem. An empirical analysis of the algorithms made by the author are provided. Additionally, the paper lists various graphs that may or nearly have a thickness of 2, which may be solutions if one can find two planar subgraphs that partition all of the graph’s edges.
The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales
The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales
Rose-Hulman Undergraduate Mathematics Journal
DNA and other polymer chains in confined spaces behave like closed loops. Arsuaga et al. \cite{AB} introduced the uniform random polygon model in order to better understand such loops in confined spaces using probabilistic and knot theoretical techniques, giving some classification on the mean squared linking number of such loops. Flapan and Kozai \cite{flapan2016linking} extended these techniques to find the mean sum of squared linking numbers for random linear embeddings of complete graphs $K_n$ and found it to have order $\Theta(n(n!))$. We further these ideas by inspecting random piecewise-linear embeddings of complete graphs and give introductory-level summaries of the ideas …
Reversibility Of Stranded Cellular Automata, Allyn Loyd
Reversibility Of Stranded Cellular Automata, Allyn Loyd
Mathematical Sciences Technical Reports (MSTR)
Cellular automata, such as the Stranded Cellular Automaton (SCA) model created by Joshua and Lana Holden, can be used to model weaving patterns. Similar models can be constructed to model macrame patterns, where strands are knotted together. If a rule is injective, then it is reversible. If a rule is surjective, then every configuration has at least one predecessor. In this paper, we will discuss the injectivity and surjectivity of several new SCA models in order to find reversible rules. We will also analyze the number of configurations with no predecessors and the number of configurations that map to the …
On Solutions Of First Order Pde With Two-Dimensional Dirac Delta Forcing Terms, Ian Robinson
On Solutions Of First Order Pde With Two-Dimensional Dirac Delta Forcing Terms, Ian Robinson
Rose-Hulman Undergraduate Mathematics Journal
We provide solutions of a first order, linear partial differential equation of two variables where the nonhomogeneous term is a two-dimensional Dirac delta function. Our results are achieved by applying the unilateral Laplace Transform, solving the subsequently transformed PDE, and reverting back to the original space-time domain. A discussion of existence and uniqueness of solutions, a derivation of solutions of the PDE coupled with a boundary and initial condition, as well as a few worked examples are provided.
The Existence Of Solutions To A System Of Nonhomogeneous Difference Equations, Stephanie Walker
The Existence Of Solutions To A System Of Nonhomogeneous Difference Equations, Stephanie Walker
Rose-Hulman Undergraduate Mathematics Journal
This article will demonstrate a process using Fixed Point Theory to determine the existence of multiple positive solutions for a type of system of nonhomogeneous even ordered boundary value problems on a discrete domain. We first reconstruct the problem by transforming the system so that it satisfies homogeneous boundary conditions. We then create a cone and an operator sufficient to apply the Guo-KrasnoselâA˘Zskii Fixed Point Theorem. The majority of the work involves developing the constraints ´ needed to utilized this fixed point theorem. The theorem is then applied three times, guaranteeing the existence of at least three distinct solutions. Thus, …
Some Thoughts On The 3 × 3 Magic Square Of Squares Problem, Desmond Weisenberg
Some Thoughts On The 3 × 3 Magic Square Of Squares Problem, Desmond Weisenberg
Rose-Hulman Undergraduate Mathematics Journal
A magic square is a square grid of numbers where each row, column, and long diagonal has the same sum (called the magic sum). An open problem popularized by Martin Gardner asks whether there exists a 3×3 magic square of distinct positive square numbers. In this paper, we expand on existing results about the prime factors of elements of such a square, and then provide a full list of the ways a prime factor could appear in one. We also suggest a separate possible computational approach based on the prime signature of the center entry of the square.
Motion Planning Algorithm In A Y-Graph, David Baldi
Motion Planning Algorithm In A Y-Graph, David Baldi
Rose-Hulman Undergraduate Mathematics Journal
We present an explicit algorithm for two robots to move autonomously and without collisions on a track shaped like the letter Y. Configuration spaces are of practical relevance in designing safe control schemes for automated guided vehicles. The topological complexity of a configuration space is the minimal number of continuous instructions required to move robots between any initial configuration to any final one without collisions. Using techniques from topological robotics, we calculate the topological complexity of two robots moving on a Y-track and exhibit an optimal algorithm realizing this exact number of instructions given by the topological complexity.
Constructing Spanning Sets Of Affine Algebraic Curvature Tensors, Stephen J. Kelly
Constructing Spanning Sets Of Affine Algebraic Curvature Tensors, Stephen J. Kelly
Rose-Hulman Undergraduate Mathematics Journal
In this paper, we construct two spanning sets for the affine algebraic curvature tensors. We then prove that every 2-dimensional affine algebraic curvature tensor can be represented by a single element from either of the two spanning sets. This paper provides a means to study affine algebraic curvature tensors in a geometric and algebraic manner similar to previous studies of canonical algebraic curvature tensors.
A Note On The Involutive Concordance Invariants For Certain (1,1)-Knots, Anna Antal, Sarah Pritchard
A Note On The Involutive Concordance Invariants For Certain (1,1)-Knots, Anna Antal, Sarah Pritchard
Rose-Hulman Undergraduate Mathematics Journal
A knot K is a smooth embedding of the circle into the three-dimensional sphere; two knots are said to be concordant if they form the boundary of an annulus properly embedded into the product of the three-sphere with an interval. Heegaard Floer knot homology is an invariant of knots introduced by P. Ozsváth and Z. Szabó in the early 2000's which associates to a knot a filtered chain complex CFK(K), which improves on classical invariants of the knot. Involutive Heegaard Floer homology is a variant theory introduced in 2015 by K. Hendricks and C. Manolescu which additionally considers a chain …
Applying Hallgren’S Algorithm For Solving Pell’S Equation To Finding The Irrational Slope Of The Launch Of A Billiard Ball, Sangheon Choi
Applying Hallgren’S Algorithm For Solving Pell’S Equation To Finding The Irrational Slope Of The Launch Of A Billiard Ball, Sangheon Choi
Mathematical Sciences Technical Reports (MSTR)
This thesis is an exploration of Quantum Computing applied to Pell’s equation in an attempt to find solutions to the Billiard Ball Problem. Pell’s equation is a Diophantine equation in the form of x2 − ny2 = 1, where n is a given positive nonsquare integer, and integer solutions are sought for x and y. We will be applying Hallgren’s algorithm for finding irrational periods in functions, in the context of billiard balls and their movement on a friction-less unit square billiard table. Our central research question has been the following: Given the cutting sequence of the billiard …
Optimal Monohedral Tilings Of Hyperbolic Surfaces, Leonardo Digiosia, Jahangir Habib, Jack Hirsch, Lea Kenigsberg, Kevin Li, Dylanger Pittman, Jackson Petty, Christopher Xue, Weitao Zhu
Optimal Monohedral Tilings Of Hyperbolic Surfaces, Leonardo Digiosia, Jahangir Habib, Jack Hirsch, Lea Kenigsberg, Kevin Li, Dylanger Pittman, Jackson Petty, Christopher Xue, Weitao Zhu
Rose-Hulman Undergraduate Mathematics Journal
The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular k-gonal tile with 120-degree angles is isoperimetric. For area π/3, the regular heptagon has 120-degree angles and therefore tiles many hyperbolic surfaces. For other areas, we show the existence of many tiles but provide no conjectured optima. On closed hyperbolic surfaces, we verify via a reduction argument using cutting and pasting transformations and convex hulls that the regular 7-gon is the optimal n-gonal tile of …
The Determining Number And Cost Of 2-Distinguishing Of Select Kneser Graphs, James E. Garrison
The Determining Number And Cost Of 2-Distinguishing Of Select Kneser Graphs, James E. Garrison
Rose-Hulman Undergraduate Mathematics Journal
A graph $G$ is said to be \emph{d-distinguishable} if there exists a not-necessarily proper coloring with $d$ colors such that only the trivial automorphism preserves the color classes. For a 2-distinguishing labeling, the \emph{ cost of $2$-distinguishing}, denoted $\rho(G),$ is defined as the minimum size of a color class over all $2$-distinguishing colorings of $G$. Our work also utilizes \emph{determining sets} of $G, $ sets of vertices $S \subseteq G$ such that every automorphism of $G$ is uniquely determined by its action on $S.$ The \emph{determining number} of a graph is the size of a smallest determining set. We investigate …
Iterated Jump Graphs, Fran Herr, Legrand Jones Ii
Iterated Jump Graphs, Fran Herr, Legrand Jones Ii
Rose-Hulman Undergraduate Mathematics Journal
The jump graph J(G) of a simple graph G has vertices which represent edges in G where two vertices in J(G) are adjacent if and only if the corresponding edges in G do not share an endpoint. In this paper, we examine sequences of graphs generated by iterating the jump graph operation and characterize the behavior of this sequence for all initial graphs. We build on work by Chartrand et al. who showed that a handful of jump graph sequences terminate and two sequences converge. We extend these results by showing that there are no non-trivial repeating sequences of jump …
The Chromatic Index Of Ring Graphs, Lilian Shaffer
The Chromatic Index Of Ring Graphs, Lilian Shaffer
Rose-Hulman Undergraduate Mathematics Journal
The goal of graph edge coloring is to color a graph G with as few colors as possible such that each edge receives a color and that adjacent edges, that is, different edges incident to a common vertex, receive different colors. The chromatic index, denoted χ′(G), is the minimum number of colors required for such a coloring to be possible. There are two important lower bounds for χ′(G) on every graph: maximum degree, denoted ∆(G), and density, denoted ω(G). Combining these two lower bounds, we know that every graph’s chromatic index must be at least ∆(G) or …
Studying Extended Sets From Young Tableaux, Eric Nofziger
Studying Extended Sets From Young Tableaux, Eric Nofziger
Rose-Hulman Undergraduate Mathematics Journal
Young tableaux are combinatorial objects related to the partitions of an integer and have various applications in representation theory. They are particularly useful in the study of the fibers arising from the Springer resolution. In recent work of Graham-Precup-Russell, an association has been made between a given row-strict tableau and three disjoint subsets of {1,2,...,n}. These subsets are then used in the study of extended Springer fibers, so we call them extended sets. In this project, we use combinatorial techniques to classify which of these extended sets correlate to a valid row-strict or standard tableau and give bounds on the …
On The Smallest Non-Trivial Action Of Saut(Fn) For Small N, Reemon Spector
On The Smallest Non-Trivial Action Of Saut(Fn) For Small N, Reemon Spector
Rose-Hulman Undergraduate Mathematics Journal
In this paper we investigate actions of SAut(Fn), the unique index 2 subgroup of Aut(Fn), on small sets, improving upon results by Baumeister--Kielak--Pierro for several small values of n. Using a computational approach for n ⩾ 5, we show that every action of SAut(Fn) on a set containing fewer than 20 elements is trivial.
Generalizations Of Commutativity In Dihedral Groups, Noah A. Heckenlively
Generalizations Of Commutativity In Dihedral Groups, Noah A. Heckenlively
Rose-Hulman Undergraduate Mathematics Journal
The probability that two elements commute in a non-Abelian finite group is at most 5 8 . We prove several generalizations of this result for dihedral groups. In particular, we give specific values for the probability that a product of an arbitrary number of dihedral group elements is equal to its reverse, and also for the probability that a product of three elements is equal to a permutation of itself or to a cyclic permutation of itself. We also show that for any r and n, there exists a dihedral group such that the probability that a product of n …
On Cantor Sets Defined By Generalized Continued Fractions, Danielle Hedvig, Masha Gorodetski
On Cantor Sets Defined By Generalized Continued Fractions, Danielle Hedvig, Masha Gorodetski
Rose-Hulman Undergraduate Mathematics Journal
We study a special class of generalized continuous fractions, both in real and complex settings, and show that in many cases, the set of numbers that can be represented by a continued fraction for that class form a Cantor set. Specifically, we study generalized continued fractions with a fixed absolute value and a variable coefficient sign. We ask the same question in the complex setting, allowing the coefficient's argument to be a multiple of \pi/2. The numerical experiments we conducted showed that in these settings the set of numbers formed by such continued fractions is a Cantor set for large …
Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng
Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng
Mathematical Sciences Technical Reports (MSTR)
In 2012, Guedes, Assis, and Lula proposed a quantum attack on a pseudorandom number generator named the Blum-Micali Pseudorandom number generator. They claimed that the quantum attack can outperform classical attacks super-polynomially. However, this paper shows that the quantum attack cannot get the correct seed and provides another corrected algorithm that is in exponential time but still faster than the classical attack. Since the original classical attacks are in exponential time, the Blum-Micali pseudorandom number generator would be still quantum resistant.
Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden
Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden
Rose-Hulman Undergraduate Mathematics Journal
The Navier-Stokes equations are used to model fluid flow. Examples include fluid structure interactions in the heart, climate and weather modeling, and flow simulations in computer gaming and entertainment. The equations date back to the 1800s, but research and development of numerical approximation algorithms continues to be an active area. To numerically solve the Navier-Stokes equations we implement a least squares finite element algorithm based on work by Roland Glowinski and colleagues. We use the deal.II academic library , the C++ language, and the Linux operating system to implement the solver. We investigate convergence rates and apply the least squares …