Digital Commons Network^™

A Measurement Of The Differential Drell-Yan Cross Section As A Function Of Invariant Mass In Proton–Proton Collisions At √ S = 13 Tev, William Robert Tabb

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

The Drell-Yan process, a crucial mechanism for producing lepton pairs in highenergy hadron collisions, serves as an essential probe for testing the Standard Model of particle physics. This dissertation presents a comprehensive measurement of the differential cross section with respect to the invariant mass of the lepton pairs, utilizing data collected by the CMS experiment at CERN from 2016 to 2018. Cross sections are essential for refining our understanding of parton distribution functions and the underlying quantum chromodynamics processes, thereby providing constraints on theoretical predictions. In this analysis, the cross sections are compared to theoretical models and simulations, offering new …

Exploring Intraplate Seismicity In The Midwest, Alexa Fernández

Department of Earth and Atmospheric Sciences: Dissertations, Theses, and Student Research

Intraplate seismicity represents a notable occurrence within the stable North American Craton. This research explores the potential sources of stresses that could reactivate older faults and influence seismic activity within this region. Among these sources, the enduring impact of the last glacial period is considered, which includes continued glacial isostatic adjustments (GIA). During GIA the lithosphere rebounds due to the retreating ice, and the forebulge caused by far-field flexure in response to the glacial load, collapses. This results in significant faulting, fracturing, and seismic activity associated with the deglaciation phase. The adjustment of the lithosphere manifests as both near surface …

Making Sandwiches: A Novel Invariant In D-Module Theory, David Lieberman

Department of Mathematics: Dissertations, Theses, and Student Research

Say I hand you a shape, any shape. It could be a line, it could be a crinkled sheet, it could even be a the intersection of a cone with a 6-dimensional hypersurface embedded in a 7-dimensional space. Your job is to tell me about the pointy bits. This task is easier when you can draw the shape; you can you just point at them. When things get more complicated, we need a bigger hammer.

In a sense, that “bigger hammer” is what the ring of differential operators is to an algebraist. Then we will say some things and stuff …

A Study On The Vanishing Of Ext, Andrew J. Soto Levins

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

This thesis has two goals. The first is to study an Ext analog of the rigidity of Tor, and the second is to study Auslander bounds.

In Chapter 2 we show that if R is an unramified hypersurface, if M and N are finitely generated R-modules, and if the nth Ext modules of M against N is zero for some n less than or equal to the grade of M, then the ith Ext module of M against N is zero for all i less than or equal to n. A corollary of this says that if …

Spreads And Transversals And Their Connection To Geproci Sets, Allison Joan Ganger

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

Spreads of [set of prime numbers]³ over finite fields can yield geproci sets. We study the existence of transversals to such spreads, proving that spreads with two transversals exist for all finite fields, before further considering the groupoids coming from spreads when transversals do or do not exist. This is further considered for spreads of higher dimensional projective spaces. We also consider how certain spreads might generalize to characteristic zero and the connection to the previously known geproci sets coming from the root systems D₄ and F₄.

Advisor: Brian Harbourne

On Regularity Of Graph C*-Algebras, Gregory Joseph Faurot

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

We prove that for any countable directed graph E with Condition (K), the corresponding graph C*-algebra C*(E) has nuclear dimension at most two. We also prove that the nuclear dimension of certain extensions is at most one, which can be applied to certain graphs to achieve the optimal upper bound of one. Finally, we generalize some previous results for O_∞ -stability of graph algebras, and prove some partial results for Z-stability.

Advisor: Christopher Schafhauser

Gevrey Class Estimates Towards Null Controllability Of A Fluid Structure Interaction System, Dylan Mcknight

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

Fluid-Structure Interaction concerns the interaction of parabolic fluids and hyperbolic elastic structures via numerous mechanisms such as boundary coupling and pressure. These models find application in blood flow, fluid flow in the eye, and air flow over plane wings. Parabolic equations are well known for “infinite speed of propagation,” which manifests itself via a uniform bound on the resolvent of the infinitesimal generator of the associated strongly continuous semigroup. Qualitatively, a solution of a parabolic pde with rough initial data is immediately smooth for any positive time. A priori, it is not clear whether a fluid structure interaction inherits any …

On Neumann Boundary Conditions For Nonlocal Models With Finite Horizon, Scott Alex Hootman-Ng

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

Nonlocal models are have recently seen an explosive interest and development in the context of fracture mechanics, diffusion, image processing, population dynamics due to their ability to approximate differential-like operators with integral operators for inherently discontinuous solutions. Much of the work in the field focuses on how concepts from partial differential equations (PDEs) can be extended to the nonlocal domain. Boundary conditions for PDEs are crucial components for applications to physical problems, prescribing data on the domain boundary to capture the behavior of physical phenomena accurately with the underlying model. In this thesis we specifically examine a Neumann-type boundary condition …

Semigroup Well-Posedness And Finite Element Analysis Of A Biot-Stokes Interactive System, Sara Mcknight

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

The coupling of a porous medium modeled by the Biot equations and a fluid has many biological applications. There are numerous ways by which to model the fluid and to couple the porous medium with the fluid. This particular model couples the Biot equations to Stokes flow along the boundary, through the Beavers-Joseph-Saffman conditions. We address semigroup well-posedness of the system via an inf-sup approach, which along the way requires consideration of a related but uncoupled static Biot system. We also present the results of finite element analysis on both the uncoupled Biot system and the coupled system.

Advisor: Sara …

Perturbations Of Representations Of Cartan Inclusions, Catherine Zimmitti

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

A free semigroup algebra is the unital, weak operator topology closed algebra generated by a collection of Cuntz-Toeplitz isometries in B(H). Ken Davidson and David Pitts asked in [9] if a self-adjoint free semigroup algebra exists; Charles Read answered this question in [28] by constructing such an example, which Ken Davidson later simplified in [8]. The construction takes a standard representation of O₂ and multiplies it by a unitary operator in the diagonal MASA of the representation. This results in a new "perturbed" representation of O₂ generating a self-adjoint free semigroup algebra.

In this thesis, …

Virtual Unknotting Numbers For Families Of Virtual Torus Knots, Kaitlin R. Tademy

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

A virtual torus knot T(p,q,VC) sits in the intersection of the well-understood torus knot and the not-so-well-understood virtual knot, making it an intriguing object to study.

The unknotting number of a classical knot K is defined unambiguously. However, "the" unknotting number when K is a virtual knot is not as clear to define, since virtual knots have both classical and virtual crossings. We will define virtual unknotting number vu(K) as the minimum number of (classical) crossing changes required to unknot K. Under this definition of virtual unknotting, not all …

Torus Surgery, Fibrations, Multisections, And Spun 4-Manifolds, Nicholas Paul Meyer

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

A compact n-manifold X is fibered if it is a fiber bundle where the fiber F and base space B are manifolds. Fibered manifolds are particularly nice, as they are essentially classified by their monodromy maps. Two common examples of 4-dimensional fibered manifolds are surface bundles over surfaces and 3-manifold bundles over the circle.

The main focus of this dissertation is to investigate fibered 4-manifolds whose boundaries are the 3-torus and how these manifolds glue together to give new closed, fibered 4-manifolds. In particular, suppose W is diffeomorphic to S¹ × E_Y (K) where Y …

Nonlocal Frameworks For Nonlinear Conservation Laws And Advection-Diffusion Processes, Anh Thuong Vo

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

Conservation laws are fundamental principles that play an important role in modeling various phenomena in physics, chemistry, and biology. However, their limitations, such as the development of shocks despite smooth initial conditions, are well known. The nonlocal model framework can be used to overcome these challenges. Nonlocal frameworks utilize integral operators that mimic differential operators but also incorporate long-range interactions within a finite horizon. This approach not only allows for non-smooth solutions, but also provides flexibility in modeling different phenomena. This study investigates the convergence of nonlocal divergence operators, defined with a general flux density function, to their classical counterparts. …

Asteroidal Sets And Dominating Targets In Graphs, Oleksiy Al-Saadi

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

The focus of this PhD thesis is on various distance and domination properties in graphs. In particular, we prove strong results about the interactions between asteroidal sets and dominating targets. Our results add to or extend a plethora of results on these properties within the literature. We define the class of strict dominating pair graphs and show structural and algorithmic properties of this class. Notably, we prove that such graphs have diameter 3, 4, or contain an asteroidal quadruple. Then, we design an algorithm to to efficiently recognize chordal hereditary dominating pair graphs. We provide new results that describe the …

Asteroidal Sets And Dominating Targets In Graphs, Oleksiy Al-Saadi

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

The focus of this Ph.D. thesis is on various distance and domination properties in graphs. In particular, we prove strong results about the interactions between asteroidal sets and dominating targets. Our results add to or extend a plethora of results on these properties within the literature. We define the class of strict dominating pair graphs and show structural and algorithmic properties of this class. Notably, we prove that such graphs have diameter 3, 4, or contain an asteroidal quadruple. Then, we design an algorithm to to efficiently recognize chordal hereditary dominating pair graphs. We provide new results that describe the …

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 …