Mathematics Commons^™

Bbt Side Mold Assy, Bill Hemphill

STEM Guitar Project’s BBT Acoustic Kit

This electronic document file set covers the design and fabrication information of the ETSU Guitar Building Project’s BBT (OM-sized) Side Mold Assy for use with the STEM Guitar Project’s standard acoustic guitar kit. The extended 'as built' data set contains an overview file and companion video, the 'parent' CADD drawing, CADD data for laser etching and cutting a drill &/or layout template, CADD drawings in AutoCAD .DWG and .DXF R12 formats of the centerline tool paths for creating the mold assembly pieces on an AXYZ CNC router, and support documentation for CAM applications including router bit specifications, feeds, speed, multi-pass …

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

An Introduction To Fröberg's Conjecture, Caroline Semmens

Master's Theses

The goal of this thesis is to make Fröberg's conjecture more accessible to the average math graduate student by building up the necessary background material to understand specific examples where Fröberg's conjecture is true.

Unique Signed Minimal Wiring Diagrams And The Stanley-Reisner Correspondence, Vanessa Newsome-Slade

Master's Theses

Biological systems are commonly represented using networks consisting of interactions between various elements in the system. Reverse engineering, a method of mathematical modeling, is used to recover how the elements in the biological network are connected. These connections are encoded using wiring diagrams, which are directed graphs that describe how elements in a network affect one another. A signed wiring diagram provides additional information about the interactions between elements relating to activation and inhibition. Due to cost concerns, it is optimal to gain insight into biological networks with as few experiments and data as possible. Minimal wiring diagrams identify the …

Van Kampen Diagrams And Small Cancellation Theory, Kelsey N. Lowrey

Master's Theses

Given a presentation of G, the word problem asks whether there exists an algorithm to determine which words in the free group, F(A), represent the identity in G. In this thesis, we study small cancellation theory, developed by Lyndon, Schupp, and Greendlinger in the mid-1960s, which contributed to the resurgence of geometric group theory. We investigate the connection between Van Kampen diagrams and the small cancellation hypotheses. Groups that have a presentation satisfying the small cancellation hypotheses C'(1/6), or C'(1/4) and T(4) have a nice solution to the word problem known as Dehn’s Algorithm.

The Zariski-Riemann Space As A Universal Model For The Birational Geometry Of A Function Field, Giovan Battista Pignatti Morano Di Custoza

Dissertations, Theses, and Capstone Projects

Given a function field $K$ over an algebraically closed field $k$, we propose to use the Zariski-Riemann space $\ZR (K/k)$ of valuation rings as a universal model that governs the birational geometry of the field extension $K/k$. More specifically, we find an exact correspondence between ad-hoc collections of open subsets of $\ZR (K/k)$ ordered by quasi-refinements and the category of normal models of $K/k$ with morphisms the birational maps. We then introduce suitable Grothendieck topologies and we develop a sheaf theory on $\ZR (K/k)$ which induces, locally at once, the sheaf theory of each normal model. Conversely, given a sheaf …

On Isomorphic K-Rational Groups Of Isogenous Elliptic Curves Over Finite Fields, Ben Kuehnert, Geneva Schlafly, Zecheng Yi

Rose-Hulman Undergraduate Mathematics Journal

It is well known that two elliptic curves are isogenous if and only if they have same number of rational points. In fact, isogenous curves can even have isomorphic groups of rational points in certain cases. In this paper, we consolidate all the current literature on this relationship and give a extensive classification of the conditions in which this relationship arises. First we prove two ordinary isogenous elliptic curves have isomorphic groups of rational points when they have the same $j$-invariant. Then, we extend this result to certain isogenous supersingular elliptic curves, namely those with equal $j$-invariant of either 0 …

An Overview Of Monstrous Moonshine, Catherine E. Riley

Channels: Where Disciplines Meet

The Conway-Norton monstrous moonshine conjecture set off a quest to discover the connection between the Monster and the J-function. The goal of this paper is to give an overview of the components of the conjecture, the conjecture itself, and some of the ideas that led to its solution. Special focus is given to Klein's J-function.

Quantum Dimension Polynomials: A Networked-Numbers Game Approach, Nicholas Gaubatz

Honors College Theses

The Networked-Numbers Game--a mathematical "game'' played on a simple graph--is incredibly accessible and yet surprisingly rich in content. The Game is known to contain deep connections to the finite-dimensional simple Lie algebras over the complex numbers. On the other hand, Quantum Dimension Polynomials (QDPs)--enumerative expressions traditionally understood through root systems--corresponding to the above Lie algebras are complicated to derive and often inaccessible to undergraduates. In this thesis, the Networked-Numbers Game is defined and some known properties are presented. Next, the significance of the QDPs as a method to count combinatorially interesting structures is relayed. Ultimately, a novel closed-form expression of …

John Horton Conway: The Man And His Knot Theory, Dillon Ketron

Electronic Theses and Dissertations

John Horton Conway was a British mathematician in the twentieth century. He made notable achievements in fields such as algebra, number theory, and knot theory. He was a renowned professor at Cambridge University and later Princeton. His contributions to algebra include his discovery of the Conway group, a group in twenty-four dimensions, and the Conway Constellation. He contributed to number theory with his development of the surreal numbers. His Game of Life earned him long-lasting fame. He contributed to knot theory with his developments of the Conway polynomial, Conway sphere, and Conway notation.

Sequential Deformations Of Hadamard Matrices And Commuting Squares, Shuler G. Hopkins

Doctoral Dissertations

In this dissertation, we study analytic and sequential deformations of commuting squares of finite dimensional von Neumann algebras, with applications to the theory of complex Hadamard matrices. The main goal is to shed some light on the structure of the algebraic manifold of spin model commuting squares (i.e., commuting squares based on complex Hadamard matrices), in the neighborhood of the standard commuting square (i.e., the commuting square corresponding to the Fourier matrix). We prove two types of results: Non-existence results for deformations in certain directions in the tangent space to the algebraic manifold of commuting squares (chapters 3 and 4), …

Modern Theory Of Copositive Matrices, Yuqiao Li

Undergraduate Honors Theses

Copositivity is a generalization of positive semidefiniteness. It has applications in theoretical economics, operations research, and statistics. An $n$-by-$n$ real, symmetric matrix $A$ is copositive (CoP) if $x^T Ax \ge 0$ for any nonnegative vector $x \ge 0.$ The set of all CoP matrices forms a convex cone. A CoP matrix is ordinary if it can be written as the sum of a positive semidefinite (PSD) matrix and a symmetric nonnegative (sN) matrix. When $n < 5,$ all CoP matrices are ordinary. However, recognizing whether a given CoP matrix is ordinary and determining an ordinary decomposition (PSD + sN) is still an unsolved problem. Here, we give an overview on modern theory of CoP matrices, talk about our progress on the ordinary recognition and decomposition problem, and emphasis the graph theory aspect of ordinary CoP matrices.

The Examination Of The Arithmetic Surface (3, 5) Over Q, Rachel J. Arguelles

Electronic Theses, Projects, and Dissertations

This thesis is centered around the construction and analysis of the principal arithmetic surface (3, 5) over Q. By adjoining the two symbols i,j, where i² = 3, j² = 5, such that ij = -ji, I can produce a quaternion algebra over Q. I use this quaternion algebra to find a discrete subgroup of SL₂(R), which I identify with isometries of the hyperbolic plane. From this quaternion algebra, I produce a large list of matrices and apply them via Mobius transformations to the point (0, 2), which is the center of my Dirichlet domain. This …

Symmetric Generation, Ana Gonzalez

Electronic Theses, Projects, and Dissertations

We will examine progenitors. We start with progenitors of the form $m^{*n} : N$ where $m^{*n}$ is a free group and $N$ is a permutation group of degree $n$. But, $m^{*n} : N$ is a group of infinite order so we will factor by the necessary relations to get finite homomorphic images. These groups are constructed through the manual double coset enumeration method. We will examine how to construct progenitors for wreath products.

Lattice Reduction Algorithms, Juan Ortega

Electronic Theses, Projects, and Dissertations

The purpose of this thesis is to propose and analyze an algorithm that follows
similar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applying
them to three-dimensions. We start off by discussing the importance of cryptography in
our day to day lives. Then we dive into some linear algebra and discuss specific topics that
will later help us in understanding lattice reduction algorithms. We discuss two lattice
problems: the shortest vector problem and the closest vector problem. Then we introduce
two types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensions
and the LLL Algortihm. We illustrate how both …

The Decomposition Of The Space Of Algebraic Curvature Tensors, Katelyn Sage Risinger

Electronic Theses, Projects, and Dissertations

We decompose the space of algebraic curvature tensors (ACTs) on a finite dimensional, real inner product space under the action of the orthogonal group into three inequivalent and irreducible subspaces: the real numbers, the space of trace-free symmetric bilinear forms, and the space of Weyl tensors. First, we decompose the space of ACTs using two short exact sequences and a key result, Lemma 3.5, which allows us to express one vector space as the direct sum of the others. This gives us a decomposition of the space of ACTs as the direct sum of three subspaces, which at this point …

Homomorphic Images And Related Topics, Alejandro Martinez

Electronic Theses, Projects, and Dissertations

In this thesis, we have demonstrated our method of writing symmetric presentations of permutation progenitors, finding monomial representations and symmetric presentations of monomial progenitors. We have also explained how various types of additional relations are found. We have discovered original symmetric presentations and original constructions of numerous groups.

Fock And Hardy Spaces: Clifford Appell Case, Daniel Alpay, Kamal Diki, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we study a specific system of Clifford–Appell polynomials and, in particular, their product. Moreover, we introduce a new family of quaternionic reproducing kernel Hilbert spaces in the framework of Fueter regular functions. The construction is based on a general idea which allows us to obtain various function spaces by specifying a suitable sequence of real numbers. We focus on the Fock and Hardy cases in this setting, and we study the action of the Fueter mapping and its range.

The Enumeration Of Minimum Path Covers Of Trees, Merielyn Sher

Undergraduate Honors Theses

A path cover of a tree T is a collection of induced paths of T that are vertex disjoint and cover all the vertices of T. A minimum path cover (MPC) of T is a path cover with the minimum possible number of paths, and that minimum number is called the path cover number of T. A tree can have just one or several MPC's. Prior results have established equality between the path cover number of a tree T and the largest possible multiplicity of an eigenvalue that can occur in a symmetric matrix whose graph is that tree. We …

Varieties Of Nonassociative Rings Of Bol-Moufang Type, Ronald E. White

All NMU Master's Theses

In this paper we investigate Bol-Moufang identities in a more general and very natural setting, \textit{nonassociative rings}.

We first introduce and define common algebras. We then explore the varieties of nonassociative rings of Bol-Moufang type. We explore two separate cases, the first where we consider binary rings, rings in which we make no assumption of it's structure. The second case we explore are rings in which, $2x=0$ implies $x=0$.

Kissing The Archimedeans, Anthony Webb

All NMU Master's Theses

In this paper the three dimensional kissing problem will be related to the Platonic and Archimedean solids. On each polyhedra presented their vertices will have spheres expanding such that the center of each of these outer spheres are the vertices of the polyhedron, and these outer spheres will continue to expand until they become tangent to each other. The ratio will be found between the radius of each outer sphere, and the radius of an inner sphere such that each inner sphere's center is the circumcenter of the polyhedron, and the inner sphere is tangent to each outer sphere. Every …

Quandles That Are Knot Quandles, Jason Haskell

All NMU Master's Theses

There are many papers that introduce the relationship between knots and quandles which are written tersely and focus mainly on applications or implications. Here, we will take time to explain in depth how to derive quandles from oriented knots. Starting with an rigorous introduction to what a knot is and what a quandle is, we will also define the Fundamental Quandle of a knot and the relationship between colorings of a knot and the homomorphisms from an arbitrary quandle to a Fundamental Quandle. Then using this foundation, we will examine two sets of knots that produce quandles that contain subquandles …

Semantic Completeness Of Intuitionistic Predicate Logic In A Fully Constructive Meta-Theory, Ian Ray

Masters Theses & Specialist Projects

A constructive proof of the semantic completeness of intuitionistic predicate logic is explored using set-generated complete Heyting Algebra. We work in a constructive set theory that avoids impredicative axioms; for this reason the result is not only intuitionistic but fully constructive. We provide background that makes the thesis accessible to the uninitiated.

Application Of Linear Algebra Within The High School Curriculum: Designing Activities To Stimulate An Interest In Upper-Level Math, Shelby Castle

Honors Theses

This senior project outlines potential lecture activities for a guest speaker or teacher in a high school classroom to present interesting applications of linear algebra. These applications are meant to be pertinent to things students at this age level are already learning or are interested in. The activities are designed such that the ideas of upper-level math are introduced in a very guided and non-intense way. The intent of the activities is mostly applications and interesting results rather than mathematical lecturing or instruction.

The high school level courses explored in this project are chemistry, economics, and health/physical education. For these …

Prime Factors: America’S Prioritization Of Literacy Over Numeracy And Its Relationship To Systemic Inequity, Troy Smith

Dissertations, Theses, and Capstone Projects

For much of American history, literacy has been prioritized in K-12 education and society, at large, at the expense of numeracy. This lack of numerical emphasis has established innumeracy as an American cultural norm that has resulted in America not producing a sufficient number of numerate citizens, and ranking poorly on mathematical performance in international comparisons. This paper investigates the decisions and circumstances that led to this under prioritization, along with the public and cultural impact of said actions. Toward this end, literature regarding contemporary and historical influences on American mathematics education (e.g., civic, policy, and parental) was reviewed. The …

Nilpotents Leave No Trace: A Matrix Mystery For Pandemic Times, Eric L. Grinberg

Journal of Humanistic Mathematics

Reopening a cold case, Inspector Echelon, high-ranking in the Row Operations Center, is searching for a lost linear map, known to be nilpotent. When a partially decomposed matrix is unearthed, he reconstructs its reduced form, finding it singular. But were its origins nilpotent?

Positivity Among P-Partition Generating Functions, Nathan R. T. Lesnevich, Peter R. W. Mcnamara

Faculty Journal Articles

We seek simple conditions on a pair of labeled posets that determine when the difference of their (P,ω)-partition enumerators is F-positive, i.e., positive in Gessel's fundamental basis. This is a quasisymmetric analogue of the extensively studied problem of finding conditions on a pair of skew shapes that determine when the difference of their skew Schur functions is Schur-positive. We determine necessary conditions and separate sufficient conditions for F-positivity, and show that a broad operation for combining posets preserves positivity properties. We conclude with classes of posets for which we have conditions that are both necessary and …

Hidden Symmetries Of The Kepler Problem, Julia Kathryn Sheffler

Senior Projects Spring 2022

The orbits of planets can be described by solving Kepler’s problem which considers the motion due to by gravity (or any inverse square force law). The solutions to Kepler’s problem, for energies less then 0, are ellipses, with a few conserved quantities: energy, angular momentum and the Laplace-Runge-Lenz (LRL) vector. Each conserved quantity corresponds to symmetries of the system via N ̈other’s theorem. Energy conservation relates to time translations and angular momentum to three dimensional rotations. The symmetry related to the LRL vector is more difficult to visualize since it lives in phase space rather than configuration space. To understand …

Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa

Honors Theses

In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …

Cryptography Through The Lens Of Group Theory, Dawson M. Shores

Electronic Theses and Dissertations

Cryptography has been around for many years, and mathematics has been around even longer. When the two subjects were combined, however, both the improvements and attacks on cryptography were prevalent. This paper introduces and performs a comparative analysis of two versions of the ElGamal cryptosystem, both of which use the specific field of mathematics known as group theory.