Algebra Commons^™

Minimal Differential Graded Algebra Resolutions Related To Certain Stanley-Reisner Rings, Todd Anthony Morra

All Dissertations

We investigate algebra structures on resolutions of a special class of Cohen-Macaulay simplicial complexes. Given a simplicial complex, we define a pure simplicial complex called the purification. These complexes arise as a generalization of certain independence complexes and the resultant Stanley-Reisner rings have numerous desirable properties, e.g., they are Cohen-Macaulay. By realizing the purification in the context of work of D'alì, et al., we obtain a multi-graded, minimal free resolution of the Alexander dual ideal of the Stanley-Reisner ideal. We augment this in a standard way to obtain a resolution of the quotient ring, which is likewise minimal and multi-graded. …

Identifying Trace Affine Linear Sets Using Homotopy Continuation, Julianne Mckay

All Theses

We investigate how the coefficients of a sparse polynomial system influence the sum, or the trace, of its solutions. We discuss an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of the support of a sparse polynomial system use sparse resultants and polyhedral geometry, respectively. We introduce a new approach which provides more precise classifications of trace affine linear sets than was previously known. For this new approach, we developed software in Macaulay2.

The Hfd Property In Orders Of A Number Field, Grant Moles

All Theses

We will examine orders R in a number field K. In particular, we will look at how the generalized class number of R relates to the class number of its integral closure R. We will then apply this to the case when K is a quadratic field to produce a more specific relation. After this, we will focus on orders R which are half-factorial domains (HFDs), in which the irreducible factorization of any element α∈R has fixed length. We will determine two cases in which R is an HFD if and only if its ring of …

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 …

Conductors And Rings With Shared Ideals, Sydney Maibach

All Theses

Given an additive subgroup $I$ of a field $K$, we define the colon ideal (I:I) = {\alpha \in K: \alpha I \subseteq I}. We then use this to construct collections of rings with shared ideals and explore relationships between these concepts and the complete integral closure.

Lyubeznik Ideals Minimally Generated By Four Or Fewer Elements, Nathan S. Fontes

All Theses

Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik …

Efficiency Of Homomorphic Encryption Schemes, Kyle Yates

All Theses

In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …

On Complete Integral Closure Of Integral Domains, Todd Fenstermacher

All Dissertations

Given an integral domain D with quotient field K, an element x in K is called integral over D if x is a root of a monic polynomial with coefficients in D. The notion of integrality has roots in Dedekind's work with algebraic integers, and was later developed more rigorously by Emmy Noether. Different variations or generalizations of integrality have since been studied, including almost integrality and pseudo-integrality. In this work we give a brief history of integrality and almost integrality before developing the basic theory of these two notions. We will continue the theory of almost integrality further by …

Characterizing Unmixed Trees And Coronas With Respect To Pmu Covers, Michael Cowen

All Dissertations

In this dissertation we study the algebraic properties of ideals constructed from graphs. We use algebraic techniques to study the PMU Placement Problem from electrical engineering which asks for optimal placement of sensors, called PMUs, in an electrical power system. Motivated by algebraic and geometric considerations, we characterize the trees for which all minimal PMU covers have the same size. Additionally, we investigate the power edge ideal of Moore, Rogers, and Sather-Wagstaff which identifies the PMU covers of a power system like the edge ideal of a graph identifies the vertex covers. We characterize the trees for which the power …

Bbt Acoustic Alternative Top Bracing Cadd Data Set-Norev-2022jun28, Bill Hemphill

STEM Guitar Project’s BBT Acoustic Kit

This electronic document file set consists of an overview presentation (PDF-formatted) file and companion video (MP4) and CADD files (DWG & DXF) for laser cutting the ETSU-developed alternate top bracing designs and marking templates for the STEM Guitar Project’s BBT (OM-sized) standard acoustic guitar kit. The three (3) alternative BBT top bracing designs in this release are
(a) a one-piece base for the standard kit's (Martin-style) bracing,
(b) 277 Ladder-style bracing, and
(c) an X-braced fan-style bracing similar to traditional European or so-called 'classical' acoustic guitars.

The CADD data set for each of the three (3) top bracing designs includes …

Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox

Theory & Applications of Graphs

In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is harmonious, and that certain starlike trees are harmonious using properties of cosets for a particular subgroup of the integers modulo m, where m is the number of edges of the graph. We expand upon these results by first exploring the numerical properties when adding values from cosets and subcosets in the integers modulo m. …

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 …

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 …

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.

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.

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 …

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 …

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 …

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.

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 …

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.

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.

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.

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$.

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 …

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 …