Physical Sciences and Mathematics Commons^™

A Cohomological Perspective To Nonlocal Operators, Nicholas White

Honors Theses

Nonlocal models have experienced a large period of growth in recent years. In particular, nonlocal models centered around a finite horizon have been the subject of many novel results. In this work we consider three nonlocal operators defined via a finite horizon: a weighted averaging operator in one dimension, an averaging differential operator, and the truncated Riesz fractional gradient. We primarily explore the kernel of each of these operators when we restrict to open sets. We discuss how the topological structure of the domain can give insight into the behavior of these operators, and more specifically the structure of their …

Quantum Computing And U.S. Cybersecurity: A Case Study Of The Breaking Of Rsa And Plan For Cryptographic Algorithm Transition, Helena Holland

Honors Theses

The invention of a cryptographically relevant quantum computer would revolutionize computing power, transforming industry and national security. While a theoretical possibility at the time of this writing, the ability of quantum algorithms to solve the factoring and discrete logarithm problems, upon which all currently employed public-key cryptography depends, presents a serious threat to digital communications. This research examines both the mathematics and government policy behind these risks and their implications for cybersecurity. Specifically, a case study of RSA, Shor’s algorithm, and the American Intelligence Community’s plan to transition toward quantum-resistant algorithms is presented to analyze quantum threats and opportunities and …

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

Dissertations and Doctoral Documents from University of Nebraska-Lincoln, 2023–

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 …

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 …

Differentiating By Prime Numbers, Jack Jeffries

Department of Mathematics: Faculty Publications

It is likely a fair assumption that you, the reader, are not only familiar with but even quite adept at differentiating by x. What about differentiating by 13? That certainly didn’t come up in my calculus class! From a calculus perspective, this is ridiculous: are we supposed to take a limit as 13 changes? One notion of differentiating by 13, or any other prime number, is the notion of p-derivation discovered independently by Joyal [Joy85] and Buium [Bui96]. p-derivations have been put to use in a range of applications in algebra, number theory, and arithmetic geometry. Despite the wide range …

A Variational Theory For Integral Functionals Involving Finite-Horizon Fractional Gradients, Javier Cueto, Carolin Carolin, Hidde Schönberger

Department of Mathematics: Faculty Publications

The center of interest in this work are variational problems with integral functionals depending on nonlocal gradients with finite horizon that correspond to truncated versions of the Riesz fractional gradient. We contribute several new aspects to both the existence theory of these problems and the study of their asymptotic behavior. Our overall proof strategy builds on finding suitable translation operators that allow to switch between the three types of gradients: classical, fractional, and nonlocal. These provide useful technical tools for transferring results from one setting to the other. Based on this approach, we show that quasiconvexity, which is the natural …

Idempotent Completions Of Equivariant Matrix Factorization Categories, Michael K. Brown, Mark E. Walker

Department of Mathematics: Faculty Publications

We prove that equivariant matrix factorization categories associated to henselian local hypersurface rings are idempotent complete, generalizing a result of Dyckerhoff in the non- equivariant case.

Analysis Of Syndrome-Based Iterative Decoder Failure Of Qldpc Codes, Kirsten D. Morris, Tefjol Pllaha, Christine A. Kelley

Department of Mathematics: Faculty Publications

Iterative decoder failures of quantum low density parity check (QLDPC) codes are attributed to substructures in the code’s graph, known as trapping sets, as well as degenerate errors that can arise in quantum codes. Failure inducing sets are subsets of codeword coordinates that, when initially in error, lead to decoding failure in a trapping set. In this paper we examine the failure inducing sets of QLDPC codes under syndrome-based iterative decoding, and their connection to absorbing sets in classical LDPC codes.

Computation Of The Basic Reproduction Numbers For Reaction-Diffusion Epidemic Models, Chayu Yang, Jin Wang

Department of Mathematics: Faculty Publications

We consider a class of k-dimensional reaction-diusion epidemic models (k = 1; 2; • • • ) that are developed from autonomous ODE systems. We present a computational approach for the calculation and analysis of their basic reproduction numbers. Particularly, we apply matrix theory to study the relationship between the basic reproduction numbers of the PDE models and those of their underlying ODE models. We show that the basic reproduction numbers are the same for these PDE models and their associated ODE models in several important scenarios. We additionally provide two numerical examples to verify our analytical results.

Pull-Push Method: A New Approach To Edge-Isoperimetric Problems, Sergei L. Bezrukov, Nikola Kuzmanovski, Jounglag Lim

Department of Mathematics: Faculty Publications

We prove a generalization of the Ahlswede-Cai local-global principle. A new technique to handle edge-isoperimetric problems is introduced which we call the pull-push method. Our main result includes all previously published results in this area as special cases with the only exception of the edge-isoperimetric problem for grids. With this we partially answer a question of Harper on local-global principles. We also describe a strategy for further generalization of our results so that the case of grids would be covered, which would completely settle Harper’s question.

When Are The Natural Embeddings Of Classical Invariant Rings Pure?, Melvin Hochster, Jack Jeffries, Vaibhav Pandey, Anurag K. Singh

Department of Mathematics: Faculty Publications

Consider a reductive linear algebraic group G acting linearly on a polynomial ring S over an infinite field; key examples are the general linear group, the symplectic group, the orthogonal group, and the special linear group, with the classical representations as inWeyl’s book: For the general linear group, consider a direct sum of copies of the standard representation and copies of the dual; in the other cases, take copies of the standard representation. The invariant rings in the respective cases are determinantal rings, rings defined by Pfaffians of alternating matrices, symmetric determinantal rings and the Plücker coordinate rings of Grassmannians; …

Applications Of Financial Mathematics: An Analysis Of Consumer Financial Decision Making, Alyssa Betterton

Honors Theses

Students always ask, “How can this be applied to the real world?” Mortgages, car loans, and credit card bills are things that almost everyone will have to make decisions about at some point in their lives. This research discusses the many different financial choices that consumers have to make. Consumers can use this information to understand how interest rates, the length of the loan, and the initial amount being borrowed affects the amount that is paid back to the companies. The intent of this thesis is to present the mathematical theory of interest. A web-based application has been built based …

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 …

Listening For Common Ground In High School And Early Collegiate Mathematics, Gail Burrill, Henry Cohn, Yvonne Lai, Dev P. Sinha, Ji Y. Son, Katherine F. Stevenson

Department of Mathematics: Faculty Publications

Solutions to pressing and complex social challenges require that we reach for common ground. Only through cooperation among people with a broad range of backgrounds and expertise can progress be made on issues as challenging as improving student success in mathematics. In this spirit, the AMS Committee on Education held a forum in May 2022 entitled The Evolving Curriculum in High School and Early Undergraduate Mathematical Sciences Education.¹ This article is a report on that forum by the authors listed above, who were among the organizers and presenters.

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 …

Theory Of Invariant Manifold And Foliation And Uniqueness Of Center Manifold Dynamics, Bo Deng

Department of Mathematics: Faculty Publications

Here we prove that the dynamics on any two center-manifolds of a fixed point of any C^k,1 dynamical system of finite dimension with k ≥ 1 are C^k-conjugate to each other. For pedagogical purpose, we also extend Perron’s method for differential equations to diffeomorphisms to construct the theory of invariant manifolds and invariant foliations at fixed points of dynamical systems of finite dimensions.

Nash Blowups Of Toric Varieties In Prime Characteristic, Daniel Duarte, Jack Jeffries, Luis Núñez-Betancourt

Department of Mathematics: Faculty Publications

We initiate the study of the resolution of singularities properties of Nash blowups over fields of prime characteristic. We prove that the iteration of normalized Nash blowups desingularizes normal toric surfaces. We also introduce a prime characteristic version of the logarithmic Jacobian ideal of a toric variety and prove that its blowup coincides with the Nash blowup of the variety. As a consequence, the Nash blowup of a, not necessarily normal, toric variety of arbitrary dimension in prime characteristic can be described combinatorially.

Extremal Absorbing Sets In Low-Density Parity-Check Codes, Emily Mcmillon, Allison Beemer, Christine A. Kelley

Department of Mathematics: Faculty Publications

Absorbing sets are combinatorial structures in the Tanner graphs of low-density parity-check (LDPC) codes that have been shown to inhibit the high signal-to-noise ratio performance of iterative decoders over many communication channels. Absorbing sets of minimum size are the most likely to cause errors, and thus have been the focus of much research. In this paper, we determine the sizes of absorbing sets that can occur in general and left-regular LDPC code graphs, with emphasis on the range of b for a given a for which an (a, b)-absorbing set may exist. We identify certain cases of extremal …

Formal Conjugacy Growth In Graph Products I, Laura Ciobanu,, Susan Hermiller, Valentin Mercier

Department of Mathematics: Faculty Publications

In this paper we give a recursive formula for the conjugacy growth series of a graph product in terms of the conjugacy growth and standard growth series of subgraph products. We also show that the conjugacy and standard growth rates in a graph product are equal provided that this property holds for each vertex group. All results are obtained for the standard generating set consisting of the union of generating sets of the vertex groups.

Using Game Theory To Model Tripolar Deterrence And Escalation Dynamics, Grace Farson

Honors Theses

The study investigated how game theory can been utilized to model multipolar escalation dynamics between Russia, China, and the United States. In addition, the study focused on analyzing various parameters that affected potential conflict outcomes to further new deterrence thought in a tripolar environment.

A preliminary game theoretic model was created to model and analyze escalation dynamics. The model was built upon framework presented by Zagare and Kilgour in their work ‘Perfect Deterrence’. The model is based on assumptions and rules set prior to game play. The model was then analyzed based upon these assumptions using a form of mathematical …

Bernstein-Sato Theory For Singular Rings In Positive Characteristic, Jack Jack, Luis Núñez-Betancourt, Eamon Quinlan-Gallego

Department of Mathematics: Faculty Publications

The Bernstein-Sato polynomial is an important invariant of an element or an ideal in a polynomial ring or power series ring of characteristic zero, with interesting connections to various algebraic and topological aspects of the singularities of the vanishing locus. Work of Mustaţă, later extended by Bitoun and the third author, provides an analogous Bernstein-Sato theory for regular rings of positive characteristic.

In this paper, we extend this theory to singular ambient rings in positive characteristic. We establish finiteness and rationality results for Bernstein-Sato roots for large classes of singular rings, and relate these roots to other classes of numerical …

Tri-Plane Diagrams For Simple Surfaces In S4, Manuel Aragón, Zack Dooley, Alexander Goldman, Yucong Lei, Isaiah Martinez, Nicholas Meyer, Devon Peters, Scott Warrander, Ana Wright, Alex Zupan

Department of Mathematics: Faculty Publications

Meier and Zupan proved that an orientable surface K in S⁴ admits a tri-plane diagram with zero crossings if and only if K is unknotted, so that the crossing number of K is zero. We determine the minimal crossing numbers of nonorientable unknotted surfaces in S⁴, proving that c(P^n,m) = max{1, |n−m|}, where P^n,m denotes the connected sum of n unknotted projective planes with normal Euler number +2 and m unknotted projective planes with normal Euler number −2. In addition, we convert Yoshikawa’s table of knotted surface ch-diagrams to tri-plane …

Decomposition Rate As An Emergent Property Of Optimal Microbial Foraging, Stefano Manzoni, Arjun Chakrawal, Glenn Ledder

Department of Mathematics: Faculty Publications

Decomposition kinetics are fundamental for quantifying carbon and nutrient cycling in terrestrial and aquatic ecosystems. Several theories have been proposed to construct process-based kinetics laws, but most of these theories do not consider that microbial decomposers can adapt to environmental conditions, thereby modulating decomposition. Starting from the assumption that a homogeneous microbial community maximizes its growth rate over the period of decomposition, we formalize decomposition as an optimal control problem where the decomposition rate is a control variable. When maintenance respiration is negligible, we find that the optimal decomposition kinetics scale as the square root of the substrate concentration, resulting …

Modeling And Analyzing Homogeneous Tumor Growth Under Virotherapy, Chayu Yang, Jin Wang

Department of Mathematics: Faculty Publications

We present a mathematical model based on ordinary differential equations to investigate the spatially homogeneous state of tumor growth under virotherapy. The model emphasizes the interaction among the tumor cells, the oncolytic viruses, and the host immune system that generates both innate and adaptive immune responses. We conduct a rigorous equilibrium analysis and derive threshold conditions that determine the growth or decay of the tumor under various scenarios. Numerical simulation results verify our analytical predictions and provide additional insight into the tumor growth dynamics.

Minimizers Of Nonlocal Polyconvex Energies In Nonlocal Hyperelasticity, José C. Bellido, Javier Cueto, Carlos Mora-Corral

Department of Mathematics: Faculty Publications

We develop a theory of existence of minimizers of energy functionals in vectorial problems based on a nonlocal gradient under Dirichlet boundary conditions. The model shares many features with the peridynamics model and is also applicable to nonlocal solid mechanics, especially nonlinear elasticity. This nonlocal gradient was introduced in an earlier work, inspired by Riesz’ fractional gradient, but suitable for bounded domains. The main assumption on the integrand of the energy is polyconvexity. Thus, we adapt the corresponding results of the classical case to this nonlocal context, notably, Piola’s identity, the integration by parts of the determinant and the weak …

Bounds On Cohomological Support Varieties, Benjamin Briggs, Eloisa Grifo, Josh Pollitz

Department of Mathematics: Faculty Publications

Over a local ring R, the theory of cohomological support varieties attaches to any bounded complex M of finitely generated R-modules an algebraic variety VR(M) that encodes homological properties of M. We give lower bounds for the dimension of VR(M) in terms of classical invariants of R. In particular, when R is Cohen-Macaulay and not complete intersection we find that there are always varieties that cannot be realized as the cohomological support of any complex. When M has finite projective dimension, we also give an upper bound for dimVR(M) in terms of the dimension of the radical of the homotopy …