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

Game-Theoretic Approaches To Optimal Resource Allocation And Defense Strategies In Herbaceous Plants, Molly R. Creagar

Department of Mathematics: Dissertations, Theses, and Student Research

Empirical evidence suggests that the attractiveness of a plant to herbivores can be affected by the investment in defense by neighboring plants, as well as investment in defense by the focal plant. Thus, allocation to defense may not only be influenced by the frequency and intensity of herbivory but also by defense strategies employed by other plants in the environment. We incorporate a neighborhood defense effect by applying spatial evolutionary game theory to optimal resource allocation in plants where cooperators are plants investing in defense and defectors are plants that do not. We use a stochastic dynamic programming model, along …

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 …

Positioning Undergraduate Learning Assistants In Instruction: A Case Study Of The La Role In Active Learning Mathematics Classrooms At The University Of Nebraska-Lincoln, Rachel Funk

Department of Mathematics: Dissertations, Theses, and Student Research

Research suggests learning assistant (LA) programs can be a change lever to support the institutionalization of active learning in postsecondary education. Some research suggests LAs offer unique benefits for STEM courses, independent from other change levers, but more research needs to be done to understand how LAs support active learning classrooms, specifically in mathematics. Research on mathematics instruction and the use of reform resources suggests that the successful implementation of reforms is impacted by perceptions individuals hold about that resource, such as the LA role. Yet, there is little research about the LA role in mathematics, particularly where the instructor …

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 …

Classroom Social Support: A Multiple Phenomenological Case Study Of Mathematics Graduate Teaching Assistants’ Decision Making In The Classroom, Brittany Johnson

Department of Mathematics: Dissertations, Theses, and Student Research

Research suggests that support offered by an instructor can have a significant impact on the student experience, both in terms of classroom performance and affective well-being. Research also suggests that there are different types of support that instructors can offer (e.g., emotional support, instrumental support, informational support, and appraisal support). Although such research suggests that students perceive and are affected by these different types of support in different ways, there does not appear to be research surrounding the decision-making process behind instructors offering the support or the extent to which social support is a priority for them in the classroom. …

Extremal Problems In Graph Saturation And Covering, Adam Volk

Department of Mathematics: Dissertations, Theses, and Student Research

This dissertation considers several problems in extremal graph theory with the aim of finding the maximum or minimum number of certain subgraph counts given local conditions. The local conditions of interest to us are saturation and covering. Given graphs F and H, a graph G is said to be F-saturated if it does not contain any copy of F, but the addition of any missing edge in G creates at least one copy of F. We say that G is H-covered if every vertex of G is contained in at least one copy of H. In the former setting, we …

Bootstrap Percolation On Random Geometric Graphs, Alyssa Whittemore

Department of Mathematics: Dissertations, Theses, and Student Research

Bootstrap Percolation is a discrete-time process that models the spread of information or disease across the vertex set of a graph. We consider the following version of this process:

Initially, each vertex of the graph is set active with probability p or inactive otherwise. Then, at each time step, every inactive vertex with at least k active neighbors becomes active. Active vertices will always remain active. The process ends when it reaches a stationary state. If all the vertices eventually become active, then we say we achieve percolation.

This process has been widely studied on many families of graphs, deterministic …

Free Complexes Over The Exterior Algebra With Small Homology, Erica Hopkins

Department of Mathematics: Dissertations, Theses, and Student Research

Let M be a graded module over a standard graded polynomial ring S. The Total Rank Conjecture by Avramov-Buchweitz predicts the total Betti number of M should be at least the total Betti number of the residue field. Walker proved this is indeed true in a large number of cases. One could then try to push this result further by generalizing this conjecture to finite free complexes which is known as the Generalized Total Rank Conjecture. However, Iyengar and Walker constructed examples to show this generalized conjecture is not always true.

In this thesis, we investigate other counterexamples of …

Results On Nonorientable Surfaces For Knots And 2-Knots, Vincent Longo

Department of Mathematics: Dissertations, Theses, and Student Research

A classical knot is a smooth embedding of the circle into the 3-sphere. We can also consider embeddings of arbitrary surfaces (possibly nonorientable) into a 4-manifold, called knotted surfaces. In this thesis, we give an introduction to some of the basics of the studies of classical knots and knotted surfaces, then present some results about nonorientable surfaces bounded by classical knots and embeddings of nonorientable knotted surfaces. First, we generalize a result of Satoh about connected sums of projective planes and twist spun knots. Specifically, we will show that for any odd natural n, the connected sum of the n-twist …

A Combinatorial Formula For Kazhdan-Lusztig Polynomials Of Sparse Paving Matroids, George Nasr

Department of Mathematics: Dissertations, Theses, and Student Research

We present a combinatorial formula using skew Young tableaux for the coefficients of Kazhdan-Lusztig polynomials for sparse paving matroids. These matroids are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. We also show the positivity of these coefficients using our formula. In special cases, such as for uniform matroids, our formula has a nice combinatorial interpretation.

Advisers: Kyungyong Lee and Jamie Radclie

N-Fold Matrix Factorizations, Eric Hopkins

Department of Mathematics: Dissertations, Theses, and Student Research

The study of matrix factorizations began when they were introduced by Eisenbud; they have since been an important topic in commutative algebra. Results by Eisenbud, Buchweitz, and Yoshino relate matrix factorizations to maximal Cohen-Macaulay modules over hypersurface rings. There are many important properties of the category of matrix factorizations, as well as tensor product and hom constructions. More recently, Backelin, Herzog, Sanders, and Ulrich used a generalization of matrix factorizations -- so called N-fold matrix factorizations -- to construct Ulrich modules over arbitrary hypersurface rings. In this dissertation we build up the theory of N-fold matrix factorizations, proving analogues of …

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

Free Semigroupoid Algebras From Categories Of Paths, Juliana Bukoski

Department of Mathematics: Dissertations, Theses, and Student Research

Given a directed graph G, we can define a Hilbert space H_G with basis indexed by the path space of the graph, then represent the vertices of the graph as projections on H_G and the edges of the graph as partial isometries on H_G. The weak operator topology closed algebra generated by these projections and partial isometries is called the free semigroupoid algebra for G. Kribs and Power showed that these algebras are reflexive, and that they are semisimple if and only if each path in the graph lies on a cycle. We extend …

Gauge-Invariant Uniqueness And Reductions Of Ordered Groups, Robert Huben

Department of Mathematics: Dissertations, Theses, and Student Research

A reduction φ of an ordered group (G,P) to another ordered group is an order homomorphism which maps each interval [1, p] bijectively onto [1, φ(p)]. We show that if (G,P) is weakly quasi-lattice ordered and reduces to an amenable ordered group, then there is a gauge-invariant uniqueness theorem for P -graph algebras. We also consider the class of ordered groups which reduce to an amenable ordered group, and show this class contains all amenable ordered groups and is closed under direct products, free products, and hereditary subgroups.

Adviser: Mark Brittenham and David Pitts

Spectral Properties Of A Non-Compact Operator In Ecology, Matthew Reichenbach

Department of Mathematics: Dissertations, Theses, and Student Research

Ecologists have used integral projection models (IPMs) to study fish and other animals which continue to grow throughout their lives. Such animals cannot shrink, since they have bony skeletons; a mathematical consequence of this is that the kernel of the integral projection operator T is unbounded, and the operator is not compact. A priori, it is unclear whether these IPMs have an asymptotic growth rate λ, or a stable-stage distribution ψ. In the case of a compact operator, these quantities are its spectral radius and the associated eigenvector, respectively. Under biologically reasonable assumptions, we prove that the non-compact operators in …

Trisections Of Flat Surface Bundles Over Surfaces, Marla Williams

Department of Mathematics: Dissertations, Theses, and Student Research

A trisection of a smooth 4-manifold is a decomposition into three simple pieces with nice intersection properties. Work by Gay and Kirby shows that every smooth, connected, orientable 4-manifold can be trisected. Natural problems in trisection theory are to exhibit trisections of certain classes of 4-manifolds and to determine the minimal trisection genus of a particular 4-manifold.

Let $\Sigma_g$ denote the closed, connected, orientable surface of genus $g$. In this thesis, we show that the direct product $\Sigma_g\times\Sigma_h$ has a $((2g+1)(2h+1)+1;2g+2h)$-trisection, and that these parameters are minimal. We provide a description of the trisection, and an algorithm to generate a …

Optimal Allocation Of Two Resources In Annual Plants, David Mcmorris

Department of Mathematics: Dissertations, Theses, and Student Research

The fitness of an annual plant can be thought of as how much fruit is produced by the end of its growing season. Under the assumption that annual plants grow to maximize fitness, we can use techniques from optimal control theory to understand this process. We introduce two models for resource allocation in annual plants which extend classical work by Iwasa and Roughgarden to a case where both carbohydrates and mineral nutrients are allocated to shoots, roots, and fruits in annual plants. In each case, we use optimal control theory to determine the optimal resource allocation strategy for the plant …

Hadamard Well-Posedness For Two Nonlinear Structure Acoustic Models, Andrew Becklin

Department of Mathematics: Dissertations, Theses, and Student Research

This dissertation focuses on the Hadamard well-posedness of two nonlinear structure acoustic models, each consisting of a semilinear wave equation defined on a smooth bounded domain $\Omega\subset\mathbb{R}^3$ strongly coupled with a Berger plate equation acting only on a flat portion of the boundary of $\Omega$. In each case, the PDE is of the following form: \begin{align*} \begin{cases} u_{tt}-\Delta u +g_1(u_t)=f(u) &\text{ in } \Omega \times (0,T),\\[1mm] w_{tt}+\Delta^2w+g_2(w_t)+u_t|_{\Gamma}=h(w)&\text{ in }\Gamma\times(0,T),\\[1mm] u=0&\text{ on }\Gamma_0\times(0,T),\\[1mm] \partial_\nu u=w_t&\text{ on }\Gamma\times(0,T),\\[1mm] w=\partial_{\nu_\Gamma}w=0&\text{ on }\partial\Gamma\times(0,T),\\[1mm] (u(0),u_t(0))=(u_0,u_1),\hspace{5mm}(w(0),w_t(0))=(w_0,w_1), \end{cases} \end{align*} where the initial data reside in the finite energy space, i.e., $$(u_0, u_1)\in H^1_{\Gamma_0}(\Omega) \times L^2(\Omega) \, \text{ …

Exploring Pedagogical Empathy Of Mathematics Graduate Student Instructors, Karina Uhing

Department of Mathematics: Dissertations, Theses, and Student Research

Interpersonal relationships are central to the teaching and learning of mathematics. One way that teachers relate to their students is by empathizing with them. In this study, I examined the phenomenon of pedagogical empathy, which is defined as empathy that influences teaching practices. Specifically, I studied how mathematics graduate student instructors conceptualize pedagogical empathy and analyzed how pedagogical empathy might influence their teaching decisions. To address my research questions, I designed a qualitative phenomenological study in which I conducted observations and interviews with 11 mathematics graduate student instructors who were teaching precalculus courses at the University of Nebraska—Lincoln.

In the …

Individual Based Model To Simulate The Evolution Of Insecticide Resistance, William B. Jamieson

Department of Mathematics: Dissertations, Theses, and Student Research

Insecticides play a critical role in agricultural productivity. However, insecticides impose selective pressures on insect populations, so the Darwinian principles of natural selection predict that resistance to the insecticide is likely to form in the insect populations. Insecticide resistance, in turn, severely reduces the utility of the insecticides being used. Thus there is a strong economic incentive to reduce the rate of resistance evolution. Moreover, resistance evolution represents an example of evolution under novel selective pressures, so its study contributes to the fundamental understanding of evolutionary theory.

Insecticide resistance often represents a complex interplay of multiple fitness trade-offs for individual …

The Derived Category Of A Locally Complete Intersection Ring, Joshua Pollitz

Department of Mathematics: Dissertations, Theses, and Student Research

Let R be a commutative noetherian ring. A well-known theorem in commutative algebra states that R is regular if and only if every complex with finitely generated homology is a perfect complex. This homological and derived category characterization of a regular ring yields important ring theoretic information; for example, this characterization solved the well-known ``localization problem" for regular local rings. The main result of this thesis is establishing an analogous characterization for when R is locally a complete intersection. Namely, R is locally a complete intersection if and only if each nontrivial complex with finitely generated homology can build a …

The T3,T4-Conjecture For Links, Katie Tucker

Department of Mathematics: Dissertations, Theses, and Student Research

An oriented n-component link is a smooth embedding of n oriented copies of S¹ into S³. A diagram of an oriented link is a projection of a link onto R² such that there are no triple intersections, with notation at double intersections to indicate under and over strands and arrows on strands to indicate orientation. A local move on an oriented link is a regional change of a diagram where one tangle is replaced with another in a way that preserves orientation. We investigate the local moves t₃ and t₄, which are …

Admissibility Of C*-Covers And Crossed Products Of Operator Algebras, Mitchell A. Hamidi

Department of Mathematics: Dissertations, Theses, and Student Research

In 2015, E. Katsoulis and C. Ramsey introduced the construction of a non-self-adjoint crossed product that encodes the action of a group of automorphisms on an operator algebra. They did so by realizing a non-self-adjoint crossed product as the subalgebra of a C*-crossed product when dynamics of a group acting on an operator algebra by completely isometric automorphisms can be extended to self-adjoint dynamics of the group acting on a C*-algebra by ∗-automorphisms. We show that this extension of dynamics is highly dependent on the representation of the given algebra and we define a lattice structure for an operator algebra's …

Unbounded Derivations Of C*-Algebras And The Heisenberg Commutation Relation, Lara M. Ismert

Department of Mathematics: Dissertations, Theses, and Student Research

This dissertation investigates the properties of unbounded derivations on C*-algebras, namely the density of their analytic vectors and a property we refer to as "kernel stabilization." We focus on a weakly-defined derivation δ_D which formalizes commutators involving unbounded self-adjoint operators on a Hilbert space. These commutators naturally arise in quantum mechanics, as we briefly describe in the introduction.

A first application of kernel stabilization for δ_D shows that a large class of abstract derivations on unbounded C*-algebras, defined by O. Bratteli and D. Robinson, also have kernel stabilization. A second application of kernel stabilization provides a sufficient condition …

Sequential Differences In Nabla Fractional Calculus, Ariel Setniker

Department of Mathematics: Dissertations, Theses, and Student Research

We study the composition of nabla fractional differences of unequal orders, known as "sequential" nabla fractional differences. The sequential differences we examine possess different bases — specifically, we establish the outer operator as having a base larger than the inner operator by at least an integer factor of 1. Further, we consider two cases of orders: first the case when the outer difference has a larger power, and second when the inner difference has a larger power.

We develop rules for sequential nabla fractional differences and present connections between the sign of a sequential difference of a function and the …