Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
Monoidal Supercategories And Superadjunction, Dene Lepine
Monoidal Supercategories And Superadjunction, Dene Lepine
Rose-Hulman Undergraduate Mathematics Journal
We define the notion of superadjunction in the context of supercategories. In particular, we give definitions in terms of counit-unit superadjunctions and hom-space superadjunctions, and prove that these two definitions are equivalent. These results generalize well-known statements in the non-super setting. In the super setting, they formalize some notions that have recently appeared in the literature. We conclude with a brief discussion of superadjunction in the language of string diagrams.
Strengthening Relationships Between Neural Ideals And Receptive Fields, Angelique Morvant
Strengthening Relationships Between Neural Ideals And Receptive Fields, Angelique Morvant
Rose-Hulman Undergraduate Mathematics Journal
Neural codes are collections of binary vectors that represent the firing patterns of neurons. The information given by a neural code C can be represented by its neural ideal JC. In turn, the polynomials in JC can be used to determine the relationships among the receptive fields of the neurons. In a paper by Curto et al., three such relationships, known as the Type 1-3 relations, were linked to the neural ideal by three if-and-only-if statements. Later, Garcia et al. discovered the Type 4-6 relations. These new relations differed from the first three in that they were …
Triangle Packing On Tripartite Graphs Is Hard, Peter A. Bradshaw
Triangle Packing On Tripartite Graphs Is Hard, Peter A. Bradshaw
Rose-Hulman Undergraduate Mathematics Journal
The problem of finding a maximum matching on a bipartite graph is well-understood and can be solved using the augmenting path algorithm. However, the similar problem of finding a large set of vertex-disjoint triangles on tripartite graphs has not received much attention. In this paper, we define a set of vertex-disjoint triangles as a “tratching.” The problem of finding a tratching that covers all vertices of a tripartite graph can be shown to be NP-complete using a reduction from the three-dimensional matching problem. In this paper, however, we introduce a new construction that allows us to emulate Boolean circuits using …
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.
Algorithms To Approximate Solutions Of Poisson's Equation In Three Dimensions, Ray Dambrose
Algorithms To Approximate Solutions Of Poisson's Equation In Three Dimensions, Ray Dambrose
Rose-Hulman Undergraduate Mathematics Journal
The focus of this research was to develop numerical algorithms to approximate solutions of Poisson's equation in three dimensional rectangular prism domains. Numerical analysis of partial differential equations is vital to understanding and modeling these complex problems. Poisson's equation can be approximated with a finite difference approximation. A system of equations can be formed that gives solutions at internal points of the domain. A computer program was developed to solve this system with inputs such as boundary conditions and a nonhomogenous source function. Approximate solutions are compared with exact solutions to prove their accuracy. The program is tested with an …