Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Cellular Automata (1)
- Combinatorics (1)
- Directed (1)
- Directed Graph (1)
- Error-correcting Codes (1)
-
- Galois Theory (1)
- Graph (1)
- Graph labeling (1)
- Graph theory (1)
- Irreducibility (1)
- Jacobian (1)
- Magic labeling (1)
- Magic square (1)
- Matroid (1)
- Modeling (1)
- Modular Arithmetic (1)
- Number puzzle (1)
- Parity Card Trick (1)
- Pascal's Triangle (1)
- Probability (1)
- Puzzle (1)
- Random Polynomials (1)
- Semiring (1)
- Total labeling (1)
- Tropical Algebra (1)
Articles 1 - 8 of 8
Full-Text Articles in Discrete Mathematics and Combinatorics
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.
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.
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 …
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.
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.
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.