Digital Commons Network^™

On Dyadic Parity Check Codes And Their Generalizations, Meraiah Martinez

Department of Mathematics: Dissertations, Theses, and Student Research

In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don’t prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low complexity graph-based decoding algorithms. Various graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis. …

Unexpectedness Stratified By Codimension, Frank Zimmitti

Department of Mathematics: Dissertations, Theses, and Student Research

A recent series of papers, starting with the paper of Cook, Harbourne, Migliore, and Nagel on the projective plane in 2018, studies a notion of unexpectedness for finite sets Z of points in N-dimensional projective space. Say the complete linear system L of forms of degree d vanishing on Z has dimension t yet for any general point P the linear system of forms vanishing on Z with multiplicity m at P is nonempty. If the dimension of L is more than the expected dimension of t−r, where r is N+m−1 choose …

On The Superabundance Of Singular Varieties In Positive Characteristic, Jake Kettinger

Department of Mathematics: Dissertations, Theses, and Student Research

The geproci property is a recent development in the world of geometry. We call a set of points Z\subseq\P_k^3 an (a,b)-geproci set (for GEneral PROjection is a Complete Intersection) if its projection from a general point P to a plane is a complete intersection of curves of degrees a and b. Examples known as grids have been known since 2011. Previously, the study of the geproci property has taken place within the characteristic 0 setting; prior to the work in this thesis, a procedure has been known for creating an (a,b)-geproci half-grid for 4\leq a\leq b, but it was not …

Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude

Department of Mathematics: Dissertations, Theses, and Student Research

We introduce and investigate a natural problem regarding unit cube tilings/partitions of Euclidean space and also consider broad generalizations of this problem. The problem fits well within a historical context of similar problems and also has applications to the study of reproducibility in randomized computation.

Given $k\in\mathbb{N}$ and $\epsilon\in(0,\infty)$, we define a $(k,\epsilon)$-secluded unit cube partition of $\mathbb{R}^{d}$ to be a unit cube partition of $\mathbb{R}^{d}$ such that for every point $\vec{p}\in\R^d$, the closed $\ell_{\infty}$ $\epsilon$-ball around $\vec{p}$ intersects at most $k$ cubes. The problem is to construct such partitions for each dimension $d$ with the primary goal of minimizing …

Gordian Distance And Complete Alexander Neighbors, Ana Wright

Department of Mathematics: Dissertations, Theses, and Student Research

We call a knot K a complete Alexander neighbor if every possible Alexander polynomial is realized by a knot one crossing change away from K. It is unknown whether there exists a complete Alexander neighbor with nontrivial Alexander polynomial. We eliminate infinite families of knots with nontrivial Alexander polynomial from having this property and discuss possible strategies for unresolved cases.

Additionally, we use a condition on determinants of knots one crossing change away from unknotting number one knots to improve KnotInfo’s unknotting number data on 11 and 12 crossing knots. Lickorish introduced an obstruction to unknotting number one, which proves …

Intrinsic Tame Filling Functions And Other Refinements Of Diameter Functions, Andrew Quaisley

Department of Mathematics: Dissertations, Theses, and Student Research

Tame filling functions are quasi-isometry invariants that are refinements of the diameter function of a group. Although tame filling functions were defined in part to provide a proper refinement of the diameter function, we show that every finite presentation of a group has an intrinsic tame filling function that is equivalent to its intrinsic diameter function. We then introduce some alternative filling functions—based on concepts similar to those used to define intrinsic tame filling functions—that are potential proper refinements of the intrinsic diameter function.

Adviser: Susan Hermiller and Mark Brittenham

Prefix-Rewriting: The Falsification By Fellow Traveler Property And Practical Computation, Ash Declerk

Department of Mathematics: Dissertations, Theses, and Student Research

The word problem is one of the fundamental areas of research in infinite group theory, and rewriting systems (including finite convergent rewriting systems, automatic structures, and autostackable structures) are key approaches to working on the word problem. In this dissertation, we discuss two approaches to creating bounded regular convergent prefix-rewriting systems.

Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. We show that groups with this geometric property are geodesically autostackable. As a key part of proving this, we …