Algebra Commons^™

On The Algebraicity Of The Tic-Tac-Toe Matroid And Homogeneous Mixed Bowtie Systems, Benjamin R. Allen

Electronic Theses and Dissertations

This thesis is presented in two parts. First, we explore whether the class of algebraic matroids is closed under duality, a decades-old open question. We consider the Tic-Tac-Toe matroid as a potential candidate to answer the open question. The Tic-Tac-Toe matroid is known to satisfy many of the necessary conditions for a matroid to be algebraic and has a non-algebraic dual.  Second, we focus on decompositions of the complete mixed graph into mixed bowties. A complete mixed graph has between every pair of vertices an undirected edge and antiparallel arcs. A mixed bowtie is a graph consisting of two 3-cycles …

A Leslie System For A Demographic Simulation: From An Actuarial Point Of View, David Kings

Electronic Theses and Dissertations

This thesis develops a discrete stochastic linear systems interpretation of age–stage demographic evolution grounded in Leslie operators and realized in a discrete-event simulation implemented with salabim. The central claim is that one annual cycle of the simulation constitutes a cone-preserving, stochastic affine transformation on a high- dimensional population state vector indexed by age, sex, marital status, household type, employment, and education, and that the composition of yearly operators yields a random matrix product whose top Lyapunov exponent is the stochastic counterpart of the Perron–Frobenius growth rate (Caswell, 2001; Tuljapurkar, 1997)[1, 2]. The actuarial bridge is constructed by mapping simulated survival …

Principal Quandles, Jesse Parrish

Electronic Theses and Dissertations

This thesis concerns principal quandles and, as a special case, Alexander quandles. A principal quandle is a coset quandle, Q(G,H, f), in which the subgroup H is trivial. If in addition the group G is abelian, then the coset quandle is called an Alexander quandle. The isomorphism types of Alexander quandles were classified [16], and some progress was made on describing the isomorphism types of principal quandles in [14] and [13]. The first part of this thesis applies the ideas used in Holmes’ paper to give a classification of the isomorphism types of principal quandles. The second …

Car Price Prediction Using Machine Learning: Analyzing The Dvm-Car Dataset, Yaman Abu Ghareebaih

Electronic Theses and Dissertations

The objective of this study is to predict car prices using machine learning models and the DVM-CAR dataset, which includes over 1.4 million images and car specifi- cations from 899 car models. Key factors such as mileage, engine power, and year of registration were analyzed for their correlation with car prices. Extensive data cleaning was performed, including filling missing values, identifying outliers, and normalizing numerical variables. Discrete variables like car make and body type were encoded using one-hot encoding. Linear relationships were analyzed with Multiple Logistic Regression, and Random Forest models were used for nonlinear patterns. Model performance was evaluated …

Diagrams In Involutive Residuated Lattices, Isis A. Gallardo

Electronic Theses and Dissertations

First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups is generated by the functional algebra on the integers. Additionally, we prove that the equational theory of this variety is decidable.

Next, we establish that DLP is equal to the join of its subvarieties LP_n, where 𝑛 ∈ ℤ⁺, consisting of 𝑛-periodic ℓ-pregroups. We also prove that every algebra in LP_n can be embedded …

Building Blocks For W-Algebras Of Classical Types, Vladimir Kovalchuk

Electronic Theses and Dissertations

The universal 2-parameter vertex algebra W_∞ of type W(2, 3, 4; . . . ) serves as a classifying object for vertex algebras of type W(2, 3, . . . ,N) for some N in the sense that under mild hypothesis, all such vertex algebras arise as quotients of W_∞. There is an ℕ X ℕ family of such 1-parameter vertex algebras known as Y-algebras. They were introduced by Gaiotto and Rapčák are expected to be building blocks for all W-algebras in type A, i.e, every W-(super) algebra in …

A History Of Complex Simple Lie Algebras, Avrila Frazier

Electronic Theses and Dissertations

In 1869, prompted by his work in differential equations, Sophus Lie wondered about categorizing what he called “closed systems of commutative transformations,” while around the same time, Wilhelm Killing’s work on non-Euclidean geometry encountered related topics. As mathematicians recognized this as a division of abstract algebra, the area became known as “continuous transformation groups," but we now refer to them as Lie groups.

Patterns and structures emerged from their work, such as describing Lie groups in connection with their associated Lie algebras, which can be categorized in many important ways. In this paper, we focus on Lie algebras over the …

Unilinear Residuated Lattices, Xiao Zhuang

Electronic Theses and Dissertations

We characterize all residuated lattices that have height equal to 3 and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint incomparable chains, with bounds added. We give the characterization of all unilinear residuated lattices. By presenting the constructions and axiomatizations for different classes of unilinear residuated lattices, we conclude that the study of unilinear residuated lattices can be reduced to the study of the ⊤-unital ones. Using the classification of unilinear residuated lattices, the idempotent unilinear residuated lattices are studied and amalgamation property and strong …

Stability Of Cauchy's Equation On Δ+., Holden Wells

Electronic Theses and Dissertations

The most famous functional equation f(x+y)=f(x)+f(y) known as Cauchy's equation due to its appearance in the seminal analysis text Cours d'Analyse (Cauchy 1821), was used to understand fundamental aspects of the real numbers and the importance of regularity assumptions in mathematical analysis. Since then, the equation has been abstracted and examined in many contexts. One such examination, introduced by Stanislaw Ulam and furthered by Donald Hyers, was that of stability. Hyers demonstrated that Cauchy's equation exhibited stability over Banach Spaces in the following sense: functions that approximately satisfy Cauchy's equation are approximated with the same level of error by functions …

Restrictions On Topological Symmetry Groups Of The 3-Rung Möbius Ladder On The Torus, Logan Willhoite

Electronic Theses and Dissertations

In this work, we discuss properties of the 3-rung Möbius ladder embedded on the surface of a torus. We present proofs on restrictions of topological symmetry groups of the Möbius ladder with and without the assumption of preserving orientation. Specifically, we show that Z₂ is the only possible non-trivial orientation-preserving topological symmetry groups, and also that Z₂ and D₂ are the only possible nontrivial topological symmetry groups.

Roots Of Quaternionic Polynomials And Automorphisms Of Roots, Olalekan Ogunmefun

Electronic Theses and Dissertations

The quaternions are an extension of the complex numbers which were first described by Sir William Rowan Hamilton in 1843. In his description, he gave the equation of the multiplication of the imaginary component similar to that of complex numbers. Many mathematicians have studied the zeros of quaternionic polynomials. Prominent of these, Ivan Niven pioneered a root-finding algorithm in 1941, Gentili and Struppa proved the Fundamental Theorem of Algebra (FTA) for quaternions in 2007. This thesis finds the zeros of quaternionic polynomials using the Fundamental Theorem of Algebra. There are isolated zeros and spheres of zeros. In this thesis, we …

Properties And Classifications Of Certain Lcd Codes., Dalton Seth Gannon

Electronic Theses and Dissertations

A linear code $C$ is called a linear complementary dual code (LCD code) if $C \cap C^\perp = {0}$ holds. LCD codes have many applications in cryptography, communication systems, data storage, and quantum coding theory. In this dissertation we show that a necessary and sufficient condition for a cyclic code $C$ over $\Z_4$ of odd length to be an LCD code is that $C=\big( f(x) \big)$ where $f$ is a self-reciprocal polynomial in $\Z_{4}[X]$ which is also in our paper \cite{GK1}. We then extend this result and provide a necessary and sufficient condition for a cyclic code $C$ of length …

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.

On Loop Commutators, Quaternionic Automorphic Loops, And Related Topics, Mariah Kathleen Barnes

Electronic Theses and Dissertations

This dissertation deals with three topics inside loop and quasigroup theory. First, as a continuation of the project started by David Stanovský and Petr Vojtĕchovský, we study the commutator of congruences defined by Freese and McKenzie in order to create a more pleasing, equivalent definition of the commutator inside of loops. Moreover, we show that the commutator can be characterized by the generators of the inner mapping group of the loop. We then translate these results to characterize the commutator of two normal subloops of any loop.

Second, we study automorphic loops with the desire to find more examples of …

Zn Orbifolds Of Vertex Operator Algebras, Daniel Graybill

Electronic Theses and Dissertations

Given a vertex algebra V and a group of automorphisms of V, the invariant subalgebra V^G is called an orbifold of V. This construction appeared first in physics and was also fundamental to the construction of the Moonshine module in the work of Borcherds. It is expected that nice properties of V such as C2-cofiniteness and rationality will be inherited by V^G if G is a finite group. It is also expected that under reasonable hypotheses, if V is strongly finitely generated and G is reductive, V^G will also be strongly finitely generated. This is an analogue …

Taking Notes: Generating Twelve-Tone Music With Mathematics, Nathan Molder

Electronic Theses and Dissertations

There has often been a connection between music and mathematics. The world of musical composition is full of combinations of orderings of different musical notes, each of which has different sound quality, length, and em phasis. One of the more intricate composition styles is twelve-tone music, where twelve unique notes (up to octave isomorphism) must be used before they can be repeated. In this thesis, we aim to show multiple ways in which mathematics can be used directly to compose twelve-tone musical scores.

Decidability For Residuated Lattices And Substructural Logics, Gavin St. John

Electronic Theses and Dissertations

We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of substructural logics by simple structural rules, with the aim of classifying simple equations by the decidability properties shared by their extensions. We also prove a number of relationships among simple extensions by showing the equational theory of their idempotent semiring reducts coincides with simple extensions of idempotent semirings. On the decidability front, we develop both semantical and syntactical …

Factorization In Integral Domains., Ryan H. Gipson

Electronic Theses and Dissertations

We investigate the atomicity and the AP property of the semigroup rings F[X; M], where F is a field, X is a variable and M is a submonoid of the additive monoid of nonnegative rational numbers. In this endeavor, we introduce the following notions: essential generators of M and elements of height (0, 0, 0, . . .) within a cancellative torsion-free monoid Γ. By considering the latter, we are able to determine the irreducibility of certain binomials of the form Xπ − 1, where π is of height (0, 0, 0, . . .), in the monoid domain. Finally, …

Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates

Electronic Theses and Dissertations

Ever since Shor's algorithm was introduced in 1994, cryptographers have been working to develop cryptosystems that can resist known quantum computer attacks. This push for quantum attack resistant schemes is known as post quantum cryptography. Specifically, my contributions to post quantum cryptography has been to the family of schemes known as Multivariate Public Key Cryptography (MPKC), which is a very attractive candidate for digital signature standardization in the post quantum collective for a wide variety of applications. In this document I will be providing all necessary background to fully understand MPKC and post quantum cryptography as a whole. Then, I …

Categories Of Residuated Lattices, Daniel Wesley Fussner

Electronic Theses and Dissertations

We present dual variants of two algebraic constructions of certain classes of residuated lattices: The Galatos-Raftery construction of Sugihara monoids and their bounded expansions, and the Aguzzoli-Flaminio-Ugolini quadruples construction of srDL-algebras. Our dual presentation of these constructions is facilitated by both new algebraic results, and new duality-theoretic tools. On the algebraic front, we provide a complete description of implications among nontrivial distribution properties in the context of lattice-ordered structures equipped with a residuated binary operation. We also offer some new results about forbidden configurations in lattices endowed with an order-reversing involution. On the duality-theoretic front, we present new results on …

Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke

Electronic Theses and Dissertations

In this dissertation, we will examine residuated mappings on a function lattice and how they behave with respect to the way-below relation. In particular, which residuated $\phi$ has the property that $F$ is way-below $\phi(F)$ for $F$ in appropriate sets. We show the way-below relation describes the separation of two functions and how this corresponds to contraction mappings on probabilistic metric spaces. A new definition for contractions is considered using the way-below relation.

Application Of Symplectic Integration On A Dynamical System, William Frazier

Electronic Theses and Dissertations

Molecular Dynamics (MD) is the numerical simulation of a large system of interacting molecules, and one of the key components of a MD simulation is the numerical estimation of the solutions to a system of nonlinear differential equations. Such systems are very sensitive to discretization and round-off error, and correspondingly, standard techniques such as Runge-Kutta methods can lead to poor results. However, MD systems are conservative, which means that we can use Hamiltonian mechanics and symplectic transformations (also known as canonical transformations) in analyzing and approximating solutions. This is standard in MD applications, leading to numerical techniques known as symplectic …

Takens Theorem With Singular Spectrum Analysis Applied To Noisy Time Series, Thomas K. Torku

Electronic Theses and Dissertations

The evolution of big data has led to financial time series becoming increasingly complex, noisy, non-stationary and nonlinear. Takens theorem can be used to analyze and forecast nonlinear time series, but even small amounts of noise can hopelessly corrupt a Takens approach. In contrast, Singular Spectrum Analysis is an excellent tool for both forecasting and noise reduction. Fortunately, it is possible to combine the Takens approach with Singular Spectrum analysis (SSA), and in fact, estimation of key parameters in Takens theorem is performed with Singular Spectrum Analysis. In this thesis, we combine the denoising abilities of SSA with the Takens …

Dihedral-Like Constructions Of Automorphic Loops, Mouna Ramadan Aboras

Electronic Theses and Dissertations

In this dissertation we study dihedral-like constructions of automorphic loops. Automorphic loops are loops in which all inner mappings are automorphisms. We start by describing a generalization of the dihedral construction for groups. Namely, if (G , +) is an abelian group, m > 1 and α ∈2 Aut(G ), let Dih(m, G, α) on Z_m × G be defined by

(i, u )(j, v ) = (i + j , ((-1)^j u + v )α^ij ).

We prove that the resulting loop is automorphic if and only if m = 2 …

Permutation Groups And Puzzle Tile Configurations Of Instant Insanity Ii, Amanda N. Justus

Electronic Theses and Dissertations

The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two solutions. Our goal is to find ways in which we only have one solution. We examine the permutation groups of the puzzle and use modern algebra to attempt to fix the puzzle. First, we find the permutation group for the case when there is only one empty slot at the top. We then examine the scenario when we add an extra column or an extra row to make the game a 4 × 5 puzzle or …

Analyzing Common Algebra-Related Misconceptions And Errors Of Middle School Students., Sarah B. Bush

Electronic Theses and Dissertations

The purpose of this study was to examine common algebra-related misconceptions and errors of middle school students. In recent years, success in Algebra I is often considered the mathematics gateway to graduation from high school and success beyond. Therefore, preparation for algebra in the middle grades is essential to student success in Algebra I and high school. This study examines the following research question: What common algebra-related misconceptions and errors exist among students in grades six and eight as identified on student responses on an annual statewide standardized assessment? In this study, qualitative document analysis of existing data was used …

Permutation Patterns, Reduced Decompositions With Few Repetitions And The Bruhat Order, Daniel Alan Daly

Electronic Theses and Dissertations

This thesis is concerned with problems involving permutations. The main focus is on connections between permutation patterns and reduced decompositions with few repetitions. Connections between permutation patterns and reduced decompositions were first studied various mathematicians including Stanley, Billey and Tenner. In particular, they studied pattern avoidance conditions on reduced decompositions with no repeated elements. This thesis classifies the pattern avoidance and containment conditions on reduced decompositions with one and two elements repeated. This classification is then used to obtain new enumeration results for pattern classes related to the reduced decompositions and introduces the technique of counting pattern classes via reduced …

Graph Theory For The Secondary School Classroom., Dayna Brown Smithers

Electronic Theses and Dissertations

After recognizing the beauty and the utility of Graph Theory in solving a variety of problems, the author decided that it would be a good idea to make the subject available for students earlier in their educational experience. In this thesis, the author developed four units in Graph Theory, namely Vertex Coloring, Minimum Spanning Tree, Domination, and Hamiltonian Paths and Cycles, which are appropriate for high school level.