Algebra Commons^™

Frobenius And Homological Dimensions Of Complexes, Taran Funk

Department of Mathematics: Dissertations, Theses, and Student Research

Much work has been done showing how one can use a commutative Noetherian local ring R of prime characteristic, viewed as algebra over itself via the Frobenius endomorphism, as a test for flatness or projectivity of a finitely generated module M over R. Work on this dates back to the famous results of Peskine and Szpiro and also that of Kunz. Here I discuss what work has been done to push this theory into modules which are not necessarily finitely generated, and display my work done to weaken the assumptions needed to obtain these results.

Adviser: Tom Marley

Symmetric Presentation Of Finite Groups, And Related Topics, Marina Michelle Duchesne

Electronic Theses, Projects, and Dissertations

We have discovered original symmetric presentations for several finite groups, including 2²:^.(2⁴:(2^.S₃)), M₁₁, 3:(PSL(3,3):2), S₈, and 2^.M₁₂. We have found homomorphic images of several progenitors, including 2^*18:((6x2):6), 2^*24:(2^.S₄), 2^*105:A₇, 3^*3:_m(2³:3), 7^*8:_m(PSL(2,7):2), 3^*4:_m(4²:2²), 7^*5:(2xA₅), and 5^*6:_mS₅. We have provided the isomorphism type of …

On The Hamiltonicity Of Subgroup Lattices, Nicholas Charles Fleece

Graduate Theses/Dissertations

In this paper we discuss the Hamiltonicity of the subgroup lattices of

different classes of groups. We provide sufficient conditions for the

Hamiltonicity of the subgroup lattices of cube-free abelian groups. We also

prove the non-Hamiltonicity of the subgroup lattices of dihedral and

dicyclic groups. We disprove a conjecture on non-abelian p-groups by

producing an infinite family of non-abelian p-groups with Hamiltonian

subgroup lattices. Finally, we provide a list of the Hamiltonicity of the

subgroup lattices of every finite group up to order 35 barring two groups.

Proper Sum Graphs, Austin Nicholas Beard

Graduate Theses/Dissertations

The Proper Sum Graph of a commutative ring with identity has the prime ideals as vertices, with two ideals adjacent if their sum is a proper ideal. This thesis expands upon the research of Dhorajia. We will cover the groundwork to understanding the basics of these graphs, and gradually narrow our efforts into the minimal prime ideals of the ring.

On Elliptic Curves, Montana S. Miller

Graduate Theses/Dissertations

An elliptic curve over the rational numbers is given by the equation y² = x³+Ax+B. In our thesis, we study elliptic curves. It is known that the set of rational points on the elliptic curve form a finitely generated abelian group induced by the secant-tangent addition law. We present an elementary proof of associativity using Maple. We also present a relatively concise proof of the Mordell-Weil Theorem.

Classification Of Cayley Rose Window Graphs, Angsuman Das, Arnab Mandal

Theory & Applications of Graphs

Rose window graphs are a family of tetravalent graphs, introduced by Steve Wilson. Following it, Kovacs, Kutnar and Marusic classified the edge-transitive rose window graphs and Dobson, Kovacs and Miklavic characterized the vertex transitive rose window graphs. In this paper, we classify the Cayley rose window graphs.

Normality Properties Of Composition Operators, Grace Weeks, Hallie Kaiser, Katy O'Malley

Celebration of Scholarship 2021

We explore two main concepts in relation to truncated composition matrices: the conditions required for the binormal and commutative properties. Both of these topics are important in linear algebra due to their connection with diagonalization.

We begin with the normal solution before moving onto the more complex binormal solutions. Then we cover conditions for the composition matrix to commute with the general matrix. Finally, we end with ongoing questions for future work.

Factoring: Difference Of Squares, Thomas Lauria

Open Educational Resources

This lesson plan will explain how to factor basic difference of squares problems

Matrix Product Structure Of A Permuted Quasi Cyclic Code And Its Dual, Perian Perdhiku

Dissertations

In my Dissertation I will work mostly with Permuted Quasi Cyclic Codes. They are a generalization of Cyclic Codes, one of the most important families of Linear Codes in Coding Theory. Linear Codes are very useful in error detection and correction. Error Detection and Correction is a technique that first detects the corrupted data sent from some transmitter over unreliable communication channels and then corrects the errors and reconstructs the original data. Unlike linear codes, cyclic codes are used to correct errors where the pattern is not clear and the error occurs in a short segment of …

Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman

Mathematical Sciences Spring Lecture Series

Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.

On Leibniz Cohomology, Jorg Feldvoss, Friedrich Wagemann

University Faculty and Staff Publications

In this paper we prove the Leibniz analogue of Whitehead's vanishing theorem for the Chevalley-Eilenberg cohomology of Lie algebras. As a consequence, we obtain the second Whitehead lemma for Leibniz algebras. Moreover, we compute the cohomology of several Leibniz algebras with ad joint or irreducible coefficients. Our main tool is a Leibniz analogue of the Hochschild-Serre spectral sequence, which is an extension of the dual of a spectral sequence of Pirashvili for Leibniz homology from symmetric bimodules to arbitrary bimodules.

Some Model Theory Of Free Groups, Christopher James Natoli

Dissertations, Theses, and Capstone Projects

There are two main sets of results, both pertaining to the model theory of free groups. In the first set of results, we prove that non-abelian free groups of finite rank at least 3 or of countable rank are not A-homogeneous. We then build on the proof of this result to show that two classes of groups, namely finitely generated free groups and finitely generated elementary free groups, fail to form A-Fraisse classes and that the class of non-abelian limit groups fails to form a strong A-Fraisse class.

The second main result is that if a countable group is elementarily …

Total Differentiability And Monogenicity For Functions In Algebras Of Order 4, I. Sabadini, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we discuss some notions of analyticity in associative algebras with unit. We also recall some basic tool in algebraic analysis and we use them to study the properties of analytic functions in two algebras of dimension four that played a relevant role in some work of the Italian school, but that have never been fully investigated.

Lattice-Ordered Pregroups Are Semi-Distributive, Nikolaos Galatos, Peter Jipsen, Michael Kinyon, Adam Přenosil

Mathematics, Physics, and Computer Science Faculty Articles and Research

We prove that the lattice reduct of every lattice-ordered pregroup is semidistributive. This is a consequence of a certain weak form of the distributive law which holds in lattice-ordered pregroups.

A Gentle Introduction To Inequalities: A Casebook From The Fullerton Mathematical Circle, Adam Glesser, Matt Rathbun, Bogdan Suceavă

Journal of Math Circles

Run for nearly a decade, the Fullerton Mathematical Circle at California State University, Fullerton prepares middle and high school students for mathematical research by exposing them to difficult problems whose solutions require only age-appropriate techniques and background. This work highlights one of the avenues of study, namely inequalities. We cover Engel's lemma, the Cauchy--Schwartz inequality, and the AM-GM inequality, as well as providing a wealth of problems where these results can be applied. Full solutions or hints, several written by Math Circle students, are given for all of the problems, as well as some commentary on how or when to …

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.

On Rank-Two And Affine Cluster Algebras, Feiyang Lin

HMC Senior Theses

Motivated by existing results about the Kronecker cluster algebra, this thesis is concerned with two families of cluster algebras, which are two different ways of generalizing the Kronecker case: rank-two cluster algebras, and cluster algebras of type A_n,1. Regarding rank-two cluster algebras, our main result is a conjectural bijection that would prove the equivalence of two combinatorial formulas for cluster variables of rank-two skew-symmetric cluster algebras. We identify a technical result that implies the bijection and make partial progress towards its proof. We then shift gears to study certain power series which arise as limits of ratios 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 …

The Complexity Of Symmetry, Matthew Lemay

HMC Senior Theses

One of the main goals of theoretical computer science is to prove limits on how efficiently certain Boolean functions can be computed. The study of the algebraic complexity of polynomials provides an indirect approach to exploring these questions, which may prove fruitful since much is known about polynomials already from the field of algebra. This paper explores current research in establishing lower bounds on invariant rings and polynomial families. It explains the construction of an invariant ring for whom a succinct encoding would imply that NP is in P/poly. It then states a theorem about the circuit complexity partial …

On The Inverse Hull Of A One-Sided Shift Of Finite Type, Aria Beaupre

HMC Senior Theses

Let S be the semigroup constructed from a one-sided shift of finite type. In this thesis, we will provide the construction of H(S), the inverse hull of S, explore the properties of H(S), and begin to characterize the structure of H(S). We will also focus on a kind of one-sided shift of finite type, Markov shifts, and prove an invariant on isomorphic inverse hulls of Markov shifts.

Interdisciplinary Thinking: Financial Literacy Crosses Disciplinary Boundaries, Marla A. Sole

Publications and Research

Financial literacy is ideally suited to be integrated into mathematics courses and taught in an interdisciplinary manner. Students learn best and are motivated when tackling real-world meaningful questions. This article shares how elementary mathematics was applied to better understand the debate about raising the minimum wage and the United States National Debt. To serve as a guide for other teachers who wish to incorporate financial literacy into their mathematics courses and take an interdisciplinary approach, this article suggests readings, data sets, and pedagogical practices. Students were engaged and enthusiastic to work on problems that challenged their thinking about financial issues.

Cayley Map Embeddings Of Complete Graphs, Miriam Scheinblum

Honors Program Theses

This paper looks at Cayley map embeddings of complete graphs on orientable surfaces. Cayley maps constrain graph embeddings to those with cyclical edge rotations, so optimal embeddings on surfaces with the minimum genus may not always be possible. We explore instances when Cayley maps succeed at optimally embedding complete graphs, and when optimal embeddings are not possible, we determine how close to optimal they can get by finding vertex rotations that result in the smallest possible genus. Many of the complete graphs we consider have prime numbers of vertices, so for each complete graph Kn we focus on mappings with …

About Automorphisms Of Some Finite Groups, Sarah Emery

West Chester University Master’s Theses

This thesis gives an introduction to some topics from group theory, with a focus on automorphism groups of finite groups. Chapter one introduces the basic definitions and properties of groups and subgroups. In chapter two, the different classifications of functions between groups are defined and some properties thereof are given. Here we define automorphisms which are the focus of the paper. Chapters three and four deal with permutation groups and Sylow theorems respectively, and are discussions of some important groups, subgroups, and theorems pertaining thereto. The topics of these chapters help with our discussion of automorphism groups in the final …

Counting Conjugacy Classes Of Elements Of Finite Order In Compact Exceptional Groups, Qidong He

Honors Theses

Given a compact exceptional group $G$ and $m,s\in\mathbb{N}$, let $N(G,m)$ be the number of conjugacy classes of elements of order $m$ in $G$, and $N(G,m,s)$ the number of such classes whose elements have $s$ distinct eigenvalues. In string theory, the problem of enumerating certain classes of vacua in the string landscape can be rephrased in terms of the study of these quantities. We develop unified combinatorial algorithms based on Burnside's Lemma that can be used to compute both quantities for each of the five compact exceptional groups. Thus, we provide a combinatorial, alternative method to that of Djoković and extend …

Proctoring And Apps In College Algebra, Cynthia M. Shelton

Theses and Dissertations--Education Sciences

The pandemic forced more instructors and students to move to online learning. For the first time, many experienced a loosening of the reigns and were forced to allow students to submit non-proctored work. Many may have questioned what students really learned in the year 2020. Many college math course competencies emphasize procedures. Now that apps can do that for students, where does that leave math instructors? Additionally, online instruction has exploded over the last decade and has challenged the teaching of college mathematics. While online instruction opens the door to access, it does beg the question of whether students complete …

Maximums Of Total Betti Numbers In Hilbert Families, Jay White

Theses and Dissertations--Mathematics

Fix a family of ideals in a polynomial ring and consider the problem of finding a single ideal in the family that has Betti numbers that are greater than or equal to the Betti numbers of every ideal in the family. Or decide if this special ideal even exists. Bigatti, Hulett, and Pardue showed that if we take the ideals with a fixed Hilbert function, there is such an ideal: the lexsegment ideal. Caviglia and Murai proved that if we take the saturated ideals with a fixed Hilbert polynomial, there is also such an ideal. We present a generalization of …

Weight Distributions, Automorphisms, And Isometries Of Cyclic Orbit Codes, Hunter Lehmann

Theses and Dissertations--Mathematics

Cyclic orbit codes are subspace codes generated by the action of the Singer subgroup Fqn* on an Fq-subspace U of Fqn. The weight distribution of a code is the vector whose ith entry is the number of codewords with distance i to a fixed reference space in the code. My dissertation investigates the structure of the weight distribution for cyclic orbit codes. We show that for full-length orbit codes with maximal possible distance the weight distribution depends only on q,n and the dimension of U. For full-length orbit codes with …

Solubility Of Additive Forms Over Local Fields, Drew Duncan

Theses and Dissertations--Mathematics

Michael Knapp, in a previous work, conjectured that every additive sextic form over $\mathbb{Q}_2(\sqrt{-1})$ and $\mathbb{Q}_2(\sqrt{-5})$ in seven variables has a nontrivial zero. In this dissertation, I show that this conjecture is true, establishing that $$\Gamma^*(6, \mathbb{Q}_2(\sqrt{-1})) = \Gamma^*(6, \mathbb{Q}_2(\sqrt{-5})) = 7.$$ I then determine the minimal number of variables $\Gamma^*(d, K)$ which guarantees a nontrivial solution for every additive form of degree $d=2m$, $m$ odd, $m \ge 3$ over the six ramified quadratic extensions of $\mathbb{Q}_2$. We prove that if $$K \in \{\mathbb{Q}_2(\sqrt{2}), \mathbb{Q}_2(\sqrt{10}), \mathbb{Q}_2(\sqrt{-2}), \mathbb{Q}_2(\sqrt{-10})\},$$ then $$\Gamma^*(d,K) = \frac{3}{2}d,$$ and if $$K \in \{\mathbb{Q}_2(\sqrt{-1}), \mathbb{Q}_2(\sqrt{-5})\},$$ then $$\Gamma^*(d,K) = …

On Properties Of Positive Semigroups In Lattices And Totally Real Number Fields, Siki Wang

CMC Senior Theses

In this thesis, we give estimates on the successive minima of positive semigroups in lattices and ideals in totally real number fields. In Chapter 1 we give a brief overview of the thesis, while Chapters 2 – 4 provide expository material on some fundamental theorems about lattices, number fields and height functions, hence setting the necessary background for the original results presented in Chapter 5. The results in Chapter 5 can be summarized as follows. For a full-rank lattice L ⊂ Rd, we are concerned with the semigroup L+ ⊆ L, which denotes the set of all vectors with nonnegative …

Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo

Williams Honors College, Honors Research Projects

In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …