Other Mathematics Commons^™

Self-Organized Criticality In Biased Activated Random Walk, Joshua Meisel

Dissertations, Theses, and Capstone Projects

We demonstrate many of the conjectured universality and self-organized criticality (SOC) properties of the interacting particle system Activated Random Walk (ARW) in the setting of one-dimensional biased walks, as formulated for instance in Levine and Silvestri’s 2024 survey. Namely, there exists the same limiting critical state for two finite ARW models, as well as for the infinite model as the density approaches its critical value from below. Many of the desired properties hold, including heavy-tailed avalanches, but spatial correlations decay exponentially fast, a deviation from the SOC paradigm. Nonetheless, the obtained decay rate vanishes with the bias. Since the critical …

Identifying Textual Predictors Of Early Termination In Clinical Trials In Medicine: An Explainable Machine-Learning Study, Rohan Ramnarain

Dissertations, Theses, and Capstone Projects

About one in five clinical trials in medicine ends early, wasting valuable resources and reducing the evidence available for developing life-saving medical treatments. This project uses a method called Trial2Vec, which is a self-supervised machine-learning method that converts clinical trial documents into dense numerical representations that capture their key design and clinical characteristics, to turn each proposed clinical trial’s written protocol into a compact numerical profile (a process referred to as embedding). These profiles are then paired with a predictive machine learning models to identify the words and phrases in the trial documents that can signal a higher risk of …

Algorithmic Problems In Automorphic Orbits Of Free Groups, Siobhan B. O'Connor

Dissertations, Theses, and Capstone Projects

One of the fundamental problems in the field of combinatorial group theory is telling when two group presentations represent isomorphic groups. Since applying a free group automorphism to the set of relators of a presentation gives an isomorphic group, we want to be able to quickly decide when looking at a relator whether a given word can be sent to it via an automorphism. We give a hands-on introduction to the automorphisms of free groups using patterns of colored beads. We show that you can make this decision correctly in constant time on average by looking for "orbit-blocking" words that …

Quiver Of Affine Monoid Of A Vector Space Over Finite Field, James Junie Chen Cleary

Dissertations, Theses, and Capstone Projects

In this paper, we study the quiver of the complex monoid algebra CAFF(n, q). There are n + 1 maximal subgroups of AFF(n, q), each isomorphic to AGL(k, q) for some 0 ≤ k ≤ n. Every irreducible representation of CAFF(n, q) arises from a character of CAGL(k, q) for a suitable k. Thus, we study two different approaches to classifying the characters of CAGL(k, q). Next, we compute the full quiver Q(CAFF(n, q)). Finally, we show that this quiver is a disjoint union of straight-line paths and that its basic algebra has radical square zero. Hence, it has finite …

A Novel Closed Monoidal Structure On The Nucleus Of A Profunctor, Samantha K. Jarvis

Dissertations, Theses, and Capstone Projects

We describe a novel closed monoidal structure on the nucleus of a profunctor enriched over a posetal category, a distinguished subcategory of the category of presheaves given by the invariant part of an adjunction induced by the profunctor. Our structure is motivated by a connection to a notion of type given by orthogonality. For specific examples, we consider the two-element enriching category {0,1} and the reals.

Limit Theorems For L-Functions In Analytic Number Theory, Asher Roberts

Dissertations, Theses, and Capstone Projects

We use the method of Radziwill and Soundararajan to prove Selberg’s central limit theorem for the real part of the logarithm of the Riemann zeta function on the critical line in the multivariate case. This gives an alternate proof of a result of Bourgade. An upshot of the method is to determine a rate of convergence in the sense of the Dudley distance. This is the same rate Selberg claims using the Kolmogorov distance. We also achieve the same rate of convergence in the case of Dirichlet L-functions. Assuming the Riemann hypothesis, we improve the rate of convergence by using …

On The Spectrum Of Quaquaversal Operators, Josiah Sugarman

Dissertations, Theses, and Capstone Projects

In 1998 Charles Radin and John Conway introduced the Quaquaversal Tiling. A three dimensional hierarchical tiling with the property that the orientations of its tiles approach a uniform distribution faster than what is possible for hierarchical tilings in two dimensions. The distribution of orientations is controlled by the spectrum of a certain Hecke operator, which we refer to as the Quaquaversal Operator. For example, by showing that the largest eigenvalue has multiplicity equal to one, Charles Radin and John Conway showed that the orientations of this tiling approach a uniform distribution. In 2008, Bourgain and Gamburd showed that this operator …

An Explicit Construction Of Sheaves In Context, Tyler A. Bryson

Dissertations, Theses, and Capstone Projects

This document details the body of theory necessary to explicitly construct sheaves of sets on a site together with the development of supporting material necessary to connect sheaf theory with the wider mathematical contexts in which it is applied. Of particular interest is a novel presentation of the plus construction suitable for direct application to a site without first passing to the generated grothendieck topology.

A Stronger Strong Schottky Lemma For Euclidean Buildings, Michael E. Ferguson

Dissertations, Theses, and Capstone Projects

We provide a criterion for two hyperbolic isometries of a Euclidean building to generate a free group of rank two. In particular, we extend the application of a Strong Schottky Lemma to buildings given by Alperin, Farb and Noskov. We then use this extension to obtain an infinite family of matrices that generate a free group of rank two. In doing so, we also introduce an algorithm that terminates in finite time if the lemma is applicable for pairs of certain kinds of matrices acting on the Euclidean building for the special linear group over certain discretely valued fields.

Prime Factors: America’S Prioritization Of Literacy Over Numeracy And Its Relationship To Systemic Inequity, Troy Smith

Dissertations, Theses, and Capstone Projects

For much of American history, literacy has been prioritized in K-12 education and society, at large, at the expense of numeracy. This lack of numerical emphasis has established innumeracy as an American cultural norm that has resulted in America not producing a sufficient number of numerate citizens, and ranking poorly on mathematical performance in international comparisons. This paper investigates the decisions and circumstances that led to this under prioritization, along with the public and cultural impact of said actions. Toward this end, literature regarding contemporary and historical influences on American mathematics education (e.g., civic, policy, and parental) was reviewed. The …

Spectral Sequences For Almost Complex Manifolds, Qian Chen

Dissertations, Theses, and Capstone Projects

In recent work, two new cohomologies were introduced for almost complex manifolds: the so-called J-cohomology and N-cohomology [CKT17]. For the case of integrable (complex) structures, the former cohomology was already considered in [DGMS75], and the latter agrees with de Rham cohomology. In this dissertation, using ideas from [CW18], we introduce spectral sequences for these two cohomologies, showing the two cohomologies have natural bigradings. We show the spectral sequence for the J-cohomology converges at the second page whenever the almost complex structure is integrable, and explain how both fit in a natural diagram involving Bott-Chern cohomology and the Frolicher spectral sequence. …

Role Of Influence In Complex Networks, Nur Dean

Dissertations, Theses, and Capstone Projects

Game theory is a wide ranging research area; that has attracted researchers from various fields. Scientists have been using game theory to understand the evolution of cooperation in complex networks. However, there is limited research that considers the structure and connectivity patterns in networks, which create heterogeneity among nodes. For example, due to the complex ways most networks are formed, it is common to have some highly “social” nodes, while others are highly isolated. This heterogeneity is measured through metrics referred to as “centrality” of nodes. Thus, the more “social” nodes tend to also have higher centrality.

In this thesis, …

At The Interface Of Algebra And Statistics, Tai-Danae Bradley

Dissertations, Theses, and Capstone Projects

This thesis takes inspiration from quantum physics to investigate mathematical structure that lies at the interface of algebra and statistics. The starting point is a passage from classical probability theory to quantum probability theory. The quantum version of a probability distribution is a density operator, the quantum version of marginalizing is an operation called the partial trace, and the quantum version of a marginal probability distribution is a reduced density operator. Every joint probability distribution on a finite set can be modeled as a rank one density operator. By applying the partial trace, we obtain reduced density operators whose diagonals …

Coincidence Of Bargaining Solutions And Rationalizability In Epistemic Games, Todd Stambaugh

Dissertations, Theses, and Capstone Projects

Chapter 1: In 1950, John Nash proposed the Bargaining Problem, for which a solution is a function that assigns to each space of possible utility assignments a single point in the space, in some sense representing the ’fair’ deal for the agents involved. Nash provided a solution of his own, and several others have been presented since then, including a notable solution by Ehud Kalai and Meir Smorodinsky. In chapter 1, a complete account is given for the conditions under which the two solutions will coincide for two player bargaining scenarios.

Chapter 2: In the same year, Nash …