Algebra Commons^™

Slₖ-Tilings And Paths In ℤᵏ, Zachery T. Peterson

Theses and Dissertations--Mathematics

An SLₖ-frieze is a bi-infinite array of integers where adjacent entries satisfy a certain diamond rule. SL₂-friezes were introduced and studied by Conway and Coxeter. Later, these were generalized to infinite matrix-like structures called tilings as well as higher values of k. A recent paper by Short showed a bijection between bi-infinite paths of reduced rationals in the Farey graph and SL₂-tilings. We extend this result to higher kby constructing a bijection between SLₖ-tilings and certain pairs of bi-infinite strips of vectors in ℤᵏ called paths. The key ingredient in the proof is the relation to Plucker friezes and Grassmannian …

Adams Operations On The Burnside Ring From Power Operations, Lewis Dominguez

Theses and Dissertations--Mathematics

Topology furnishes us with many commutative rings associated to finite groups. These include the complex representation ring, the Burnside ring, and the G-equivariant K-theory of a space. Often, these admit additional structure in the form of natural operations on the ring, such as power operations, symmetric powers, and Adams operations. We will discuss two ways of constructing Adams operations. The goal of this work is to understand these in the case of the Burnside ring.

Properties Of Skew-Polynomial Rings And Skew-Cyclic Codes, Kathryn Hechtel

Theses and Dissertations--Mathematics

A skew-polynomial ring is a polynomial ring over a field, with one indeterminate x, where one must apply an automorphism to commute coefficients with x. It was first introduced by Ore in 1933 and since the 1980s has been used to study skew-cyclic codes. In this thesis, we present some properties of skew-polynomial rings and some new constructions of skew-cyclic codes. The dimension of a skew-cyclic code depends on the degree of its generating skew polynomial. However, due to the skew-multiplication rule, the degree of a skew polynomial can be smaller than its number of roots and hence tricky to …

Pairs Of Quadratic Forms Over P-Adic Fields, John Hall

Theses and Dissertations--Mathematics

Given two quadratic forms $Q_1, Q_2$ over a $p$-adic field $K$ in $n$ variables, we consider the pencil $\mathcal{P}_K(Q_1, Q_2)$, which contains all nontrivial $K$-linear combinations of $Q_1$ and $Q_2$. We define $D$ to be the maximal dimension of a subspace in $K^n$ on which $Q_1$ and $Q_2$ both vanish. We define $H$ to be the maximal number of hyperbolic planes that a form in $\mathcal{P}_K(Q_1, Q_2)$ splits off over $K$. We will determine which values for $(D, H)$ are possible for a nonsingular pair of quadratic forms over a $p$-adic field $K$.

Bicategorical Character Theory, Travis Wheeler

Theses and Dissertations--Mathematics

In 2007, Nora Ganter and Mikhail Kapranov defined the categorical trace, which they used to define the categorical character of a 2-representation. In 2008, Kate Ponto defined a shadow functor for bicategories. With the shadow functor, Dr. Ponto defined the bicategorical trace, which is a generalization of the symmetric monoidal trace for bicategories. How are these two notions of trace related to one another? We’ve used bicategorical traces to define a character theory for 2-representations, and the categorical character is an example.

Computational Methods For Oi-Modules, Michael Morrow

Theses and Dissertations--Mathematics

Computational commutative algebra has become an increasingly popular area of research. Central to the theory is the notion of a Gröbner basis, which may be thought of as a nonlinear generalization of Gaussian elimination. In 2019, Nagel and Römer introduced FI- and OI-modules over FI- and OI-algebras, which provide a framework for studying sequences of related modules defined over sequences of related polynomial rings. In particular, they laid the foundations of a theory of Gröbner bases for certain classes of OI-modules. In this dissertation we develop an OI-analog of Buchberger's algorithm in order to compute such Gröbner bases, as well …

Q-Polymatroids And Their Application To Rank-Metric Codes., Benjamin Jany

Theses and Dissertations--Mathematics

Matroid theory was first introduced to generalize the notion of linear independence. Since its introduction, the theory has found many applications in various areas of mathematics including coding theory. In recent years, q-matroids, the q-analogue of matroids, were reintroduced and found to be closely related to the theory of linear vector rank metric codes. This relation was then generalized to q-polymatroids and linear matrix rank metric codes. This dissertation aims at developing the theory of q-(poly)matroid and its relation to the theory of rank metric codes. In a first part, we recall and establish preliminary results for both q-polymatroids and …

Toric Bundles As Mori Dream Spaces, Courtney George

Theses and Dissertations--Mathematics

A projective, normal variety is called a Mori dream space when its Cox ring is finitely generated. These spaces are desirable to have, as they behave nicely under the Minimal Model Program, but no complete classification of them yet exists. Some early work identified that all toric varieties are examples of Mori dream spaces, as their Cox rings are polynomial rings. Therefore, a natural next step is to investigate projectivized toric vector bundles. These spaces still carry much of the combinatorial data as toric varieties, but have more variable behavior that means that they aren't as straightforward as Mori dream …

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) = …

Simultaneous Zeros Of A System Of Two Quadratic Forms, Nandita Sahajpal

Theses and Dissertations--Mathematics

In this dissertation we investigate the existence of a nontrivial solution to a system of two quadratic forms over local fields and global fields. We specifically study a system of two quadratic forms over an arbitrary number field. The questions that are of particular interest are:

1. How many variables are necessary to guarantee a nontrivial zero to a system of two quadratic forms over a global field or a local field? In other words, what is the u-invariant of a pair of quadratic forms over any global or local field?
2. What is the relation between u-invariants of a …

Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok

Theses and Dissertations--Mathematics

This dissertation is devoted to the study of the geometric properties of subspace configurations, with an emphasis on configurations of points. One distinguishing feature is the widespread use of techniques from Matroid Theory and Combinatorial Optimization. In part we generalize a theorem of Edmond's about partitions of matroids in independent subsets. We then apply this to establish a conjectured bound on the Castelnuovo-Mumford regularity of a set of fat points.

We then study how the dimension of an ideal of point changes when intersected with a generic fat subspace. In particular we introduce the concept of a ``very unexpected hypersurface'' …

Algebraic And Geometric Properties Of Hierarchical Models, Aida Maraj

Theses and Dissertations--Mathematics

In this dissertation filtrations of ideals arising from hierarchical models in statistics related by a group action are are studied. These filtrations lead to ideals in polynomial rings in infinitely many variables, which require innovative tools. Regular languages and finite automata are used to prove and explicitly compute the rationality of some multivariate power series that record important quantitative information about the ideals. Some work regarding Markov bases for non-reducible models is shown, together with advances in the polyhedral geometry of binary hierarchical models.

Lattice Simplices: Sufficiently Complicated, Brian Davis

Theses and Dissertations--Mathematics

Simplices are the "simplest" examples of polytopes, and yet they exhibit much of the rich and subtle combinatorics and commutative algebra of their more general cousins. In this way they are sufficiently complicated --- insights gained from their study can inform broader research in Ehrhart theory and associated fields.

In this dissertation we consider two previously unstudied properties of lattice simplices; one algebraic and one combinatorial. The first is the Poincar\'e series of the associated semigroup algebra, which is substantially more complicated than the Hilbert series of that same algebra. The second is the partial ordering of the elements of …

Equivalence Of Classical And Quantum Codes, Tefjol Pllaha

Theses and Dissertations--Mathematics

In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, …

The State Of Lexicodes And Ferrers Diagram Rank-Metric Codes, Jared E. Antrobus

Theses and Dissertations--Mathematics

In coding theory we wish to find as many codewords as possible, while simultaneously maintaining high distance between codewords to ease the detection and correction of errors. For linear codes, this translates to finding high-dimensional subspaces of a given metric space, where the induced distance between vectors stays above a specified minimum. In this work I describe the recent advances of this problem in the contexts of lexicodes and Ferrers diagram rank-metric codes.

In the first chapter, we study lexicodes. For a ring R, we describe a lexicographic ordering of the left R-module Rⁿ. With this …

The Partition Lattice In Many Guises, Dustin G. Hedmark

Theses and Dissertations--Mathematics

This dissertation is divided into four chapters. In Chapter 2 the equivariant homology groups of upper order ideals in the partition lattice are computed. The homology groups of these filters are written in terms of border strip Specht modules as well as in terms of links in an associated complex in the lattice of compositions. The classification is used to reproduce topological calculations of many well-studied subcomplexes of the partition lattice, including the d-divisible partition lattice and the Frobenius complex. In Chapter 3 the box polynomial B_{m,n}(x) is defined in terms of all integer partitions that fit in an m …

Colorings Of Hamming-Distance Graphs, Isaiah H. Harney

Theses and Dissertations--Mathematics

Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into …

On P-Adic Fields And P-Groups, Luis A. Sordo Vieira

Theses and Dissertations--Mathematics

The dissertation is divided into two parts. The first part mainly treats a conjecture of Emil Artin from the 1930s. Namely, if f = a_1x_1^d + a_2x_2^d +...+ a_{d^2+1}x^d where the coefficients a_i lie in a finite unramified extension of a rational p-adic field, where p is an odd prime, then f is isotropic. We also deal with systems of quadratic forms over finite fields and study the isotropicity of the system relative to the number of variables. We also study a variant of the classical Davenport constant of finite abelian groups and relate it to the isotropicity of diagonal …

On Skew-Constacyclic Codes, Neville Lyons Fogarty

Theses and Dissertations--Mathematics

Cyclic codes are a well-known class of linear block codes with efficient decoding algorithms. In recent years they have been generalized to skew-constacyclic codes; such a generalization has previously been shown to be useful. We begin with a study of skew-polynomial rings so that we may examine these codes algebraically as quotient modules of non-commutative skew-polynomial rings. We introduce a skew-generalized circulant matrix to aid in examining skew-constacyclic codes, and we use it to recover a well-known result on the duals of skew-constacyclic codes from Boucher/Ulmer in 2011. We also motivate and develop a notion of idempotent elements in these …

Kronecker's Theory Of Binary Bilinear Forms With Applications To Representations Of Integers As Sums Of Three Squares, Jonathan A. Constable

Theses and Dissertations--Mathematics

In 1883 Leopold Kronecker published a paper containing “a few explanatory remarks” to an earlier paper of his from 1866. His work loosely connected the theory of integral binary bilinear forms to the theory of integral binary quadratic forms. In this dissertation we discover the statements within Kronecker's paper and offer detailed arithmetic proofs. We begin by developing the theory of binary bilinear forms and their automorphs, providing a classification of integral binary bilinear forms up to equivalence, proper equivalence and complete equivalence.

In the second chapter we introduce the class number, proper class number and complete class number as …

Analysis And Constructions Of Subspace Codes, Carolyn E. Troha

Theses and Dissertations--Mathematics

Random network coding is the most effcient way to send data across a network, but it is very susceptible to errors and erasures. In 2008, Kotter and Kschischang introduced subspace codes as an algebraic approach to error correcting in random network coding. Since this paper, there has been much work in constructing large subspace codes, as well as exploring the properties of such codes. This dissertation explores properties of one particular construction and introduces a new construction for subspace codes. We begin by exploring properties of irreducible cyclic orbit codes, which were introduced in 2011 by Rosenthal et al. As …

Determinantal Ideals From Symmetrized Skew Tableaux, Bill Robinson

Theses and Dissertations--Mathematics

We study a class of determinantal ideals called skew tableau ideals, which are generated by t x t minors in a subset of a symmetric matrix of indeterminates. The initial ideals have been studied in the 2 x 2 case by Corso, Nagel, Petrovic and Yuen. Using liaison techniques, we have extended their results to include the original determinantal ideals in the 2 x 2 case, as well as special cases of the ideals in the t x t case. In particular, for any skew tableau ideal of this form, we have defined an elementary biliaison between it and one …

Free Resolutions Associated To Representable Matroids, Nicholas D. Armenoff

Theses and Dissertations--Mathematics

As a matroid is naturally a simplicial complex, one can study its combinatorial properties via the associated Stanley-Reisner ideal and its corresponding free resolution. Using results by Johnsen and Verdure, we prove that a matroid is the dual to a perfect matroid design if and only if its corresponding Stanley-Reisner ideal has a pure free resolution, and, motivated by applications to their generalized Hamming weights, characterize free resolutions corresponding to the vector matroids of the parity check matrices of Reed-Solomon codes and certain BCH codes. Furthermore, using an inductive mapping cone argument, we construct a cellular resolution for the matroid …

A Characterization Of Serre Classes Of Reflexive Modules Over A Complete Local Noetherian Ring, Casey R. Monday

Theses and Dissertations--Mathematics

Serre classes of modules over a ring R are important because they describe relationships between certain classes of modules and sets of ideals of R. We characterize the Serre classes of three different types of modules. First we characterize all Serre classes of noetherian modules over a commutative noetherian ring. By relating noetherian modules to artinian modules via Matlis duality, we characterize the Serre classes of artinian modules. A module M is reflexive with respect to E if the natural evaluation map from M to its bidual is an isomorphism. When R is complete local and noetherian, take E as …

Subfunctors Of Extension Functors, Furuzan Ozbek

Theses and Dissertations--Mathematics

This dissertation examines subfunctors of Ext relative to covering (enveloping) classes and the theory of covering (enveloping) ideals. The notion of covers and envelopes by modules was introduced independently by Auslander-Smalø and Enochs and has proven to be beneficial for module theory as well as for representation theory. The first few chapters examine the subfunctors of Ext and their properties. It is showed how the class of precoverings give us subfunctors of Ext. Furthermore, the characterization of these subfunctors and some examples are given. In the latter chapters ideals, the subfunctors of Hom, are investigated. The definition of cover and …

Boij-Söderberg Decompositions, Cellular Resolutions, And Polytopes, Stephen Sturgeon

Theses and Dissertations--Mathematics

Boij-Söderberg theory shows that the Betti table of a graded module can be written as a linear combination of pure diagrams with integer coefficients. In chapter 2 using Ferrers hypergraphs and simplicial polytopes, we provide interpretations of these coefficients for ideals with a d-linear resolution, their quotient rings, and for Gorenstein rings whose resolution has essentially at most two linear strands. We also establish a structural result on the decomposition in the case of quasi-Gorenstein modules. These results are published in the Journal of Algebra, see [25].

In chapter 3 we provide some further results about Boij-Söderberg decompositions. We …

Algebraic Properties Of Formal Power Series Composition, Thomas S. Brewer

Theses and Dissertations--Mathematics

The study of formal power series is an area of interest that spans many areas of mathematics. We begin by looking at single-variable formal power series with coefficients from a field. By restricting to those series which are invertible with respect to formal composition we form a group. Our focus on this group focuses on the classification of elements having finite order. The notion of a semi-cyclic group comes up in this context, leading to several interesting results about torsion subgroups of the group. We then expand our focus to the composition of multivariate formal power series, looking at similar …

Homological Algebra With Filtered Modules, Raymond Edward Kremer

Theses and Dissertations--Mathematics

Classical homological algebra is done in a category of modules beginning with the study of projective and injective modules. This dissertation investigates analogous notions of projectivity and injectivity in a category of filtered modules. This category is similar to one studied by Sjödin, Nǎstǎsescu, and Van Oystaeyen. In particular, projective and injective objects with respect to the restricted class of strict morphisms are defined and characterized. Additionally, an analogue to the injective envelope is discussed with examples showing how this differs from the usual notion of an injective envelope.