Algebra Commons^™

A Map-Algebra-Inspired Approach For Interacting With Wireless Sensor Networks, Cyber-Physical Systems Or Internet Of Things, David Almeida

Electronic Theses and Dissertations

The typical approach for consuming data from wireless sensor networks (WSN) and Internet of Things (IoT) has been to send data back to central servers for processing and analysis. This thesis develops an alternative strategy for processing and acting on data directly in the environment referred to as Active embedded Map Algebra (AeMA). Active refers to the near real time production of data, and embedded refers to the architecture of distributed embedded sensor nodes. Network macroprogramming, a style of programming adopted for wireless sensor networks and IoT, addresses the challenges of coordinating the behavior of multiple connected devices through a …

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 …

A Vector-Valued Trace Formula For Finite Groups, Miles Chasek

Electronic Theses and Dissertations

We derive a trace formula that can be used to study representations of a finite group G induced from arbitrary representations of a subgroup Γ. We restrict our attention to finite-dimensional representations over the field of complex numbers. We consider some applications and examples of our trace formula, including a proof of the well-known Frobenius reciprocity theorem.

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 …

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 …

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.

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 …

Gray Codes In Music Theory, Isaac L. Vaccaro

Electronic Theses and Dissertations

In the branch of Western music theory called serialism, it is desirable to construct chord progressions that use each chord in a chosen set exactly once. We view this problem through the scope of the mathematical theory of Gray codes, the notion of ordering a finite set X so that adjacent elements are related by an element of some specified set R of involutions in the permutation group of X. Using some basic results from the theory of permutation groups we translate the problem of finding Gray codes into the problem of finding Hamiltonian paths and cycles in a Schreier …

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 …

Totally Acyclic Complexes, Holly M. Zolt

Electronic Theses and Dissertations

We consider the following question: when is every exact complex of injective modules a totally acyclic one? It is known, for example, that over a commutative Noetherian ring of finite Krull dimension this condition is equivalent with the ring being Iwanaga-Gorenstein. We give equivalent characterizations of the condition that every exact complex of injective modules (over arbitrary rings) is totally acyclic. We also give a dual result giving equivalent characterizations of the condition that every exact complex of flat modules is F-totally acyclic over an arbitrary ring.

Homological Constructions Over A Ring Of Characteristic 2, Michael S. Nelson

Electronic Theses and Dissertations

We study various homological constructions over a ring $R$ of characteristic $2$. We construct chain complexes over a field $K$ of characteristic $2$ using polynomials rings and partial derivatives. We also provide a link from the homology of these chain complexes to the simplicial homology of simplicial complexes. We end by showing how to construct all finitely-generated commutative differential graded $R$-algebras using polynomial rings and partial derivatives.

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 …

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, …

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 …

A Journey To The Adic World, Fayadh Kadhem

Electronic Theses and Dissertations

The first idea of this research was to study a topic that is related to both Algebra and Topology and explore a tool that connects them together. That was the entrance for me to the “adic world”. What was needed were some important concepts from Algebra and Topology, and so they are treated in the first two chapters.

The reader is assumed to be familiar with Abstract Algebra and Topology, especially with Ring theory and basics of Point-set Topology.

The thesis consists of a motivation and four chapters, the third and the fourth being the main ones. In the third …

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 …

Fiber Products In Commutative Algebra, Keller Vandebogert

Electronic Theses and Dissertations

The purpose of this thesis is to introduce and illustrate some of the deep connections between commutative and homological algebra. We shall cover some of the fundamental definitions and introduce several important classes of commutative rings. The later chapters will consider a particular class of rings, the \emph{fiber product}, and, among other results, show that any Gorenstein fiber product is precisely a one dimensional hypersurface. It will also be shown that any Noetherian local ring with a (nontrivially) decomposable maximal ideal satisfies the Auslander-Reiten conjecture. To conclude, generalizations of results by Takahashi and Atkins-Vraciu shall be presented.

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 …

Gorenstein Projective (Pre)Covers, Michael J. Fox

Electronic Theses and Dissertations

The existence of the Gorenstein projective precovers is one of the main open problems in Gorenstein Homological algebra. We give sufficient conditions in order for the class of Gorenstein projective complexes to be special precovering in the category of complexes of R-modules Ch(R). More precisely, we prove that if every complex in Ch(R) has a special Gorenstein flat cover, every Gorenstein projective complex is Gorenstein flat, and every Gorenstein flat complex has finite Goenstein projective dimension, then the class of Gorenstein projective complexes, GP(C), is special precovering in Ch(R).

Gorenstein Projective Precovers In The Category Of Modules, Katelyn Coggins

Electronic Theses and Dissertations

It was recently proved that if R is a coherent ring such that R is also left n-perfect, then the class of Gorenstein projective modules, GP, is precovering. We will prove that the class of Gorenstein projective modules is special precovering over any left GF-closed ring R such that every Gorenstein projective module is Gorenstein flat and every Gorenstein flat module has finite Gorenstein projective dimension. This class of rings includes that of right coherent and left n-perfect rings.

On Dedekind’S “Über Die Permutationen Des Körpers Aller Algebraischen Zahlen", Joseph Jp Arsenault Jr

Electronic Theses and Dissertations

We provide an analytic read-through of Richard Dedekind's 1901 article “Über die Permutationen des Körpers aller algebraischen Zahlen," describing the principal results concerning infinite Galois theory from both Dedekind's point of view and a modern perspective, noting an apparently uncorrected error in the supplement to the article in the Collected Works. As there is no published English-language translation of the article, we provide an annotated original translation.

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 …

Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov

Electronic Theses and Dissertations

In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.

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 …