Mathematics Commons^™

An Interpolating Regime For The Extreme Values Of A Random Zeta Model, Christine K. Chang

Dissertations, Theses, and Capstone Projects

We study the large values of a random model of the Riemann zeta function over short intervals. The extreme value statistics depend on the interval size: the log-correlated regime governs intervals of order one while the i.i.d. regime emerges over longer intervals. The main focus is to describe the transition between these two well-understood regimes as the interval varies in length. This thesis shows that there is an intermediate regime where the behavior of the zeta model’s maxima cannot be entirely captured by either extreme— i.i.d. or fully log-correlated. This suggests that the Riemann zeta function exhibits correlations around its …

The Cannon-Thurston Map For Relatively Hyperbolic Free-By-Cyclic Groups, Kailey Beth Perry

Graduate Theses and Dissertations

Let F = H1 ∗ · · · ∗ Hk ∗ Fr be a splitting of a finitely generated free group, H = {H1 , . . . , Hk } a set of subgroups of F , and Φ ∈ Aut(F ) an automorphism such that for any i, Φ([Hi ]) = [Hj ] for some j. Consider the free-by-cyclic group Gϕ = ⟨F, t | t−1 xt = Φ(x)⟩. Suppose Gϕ is strongly hyperbolic relative to H̃ = {H̃1 , . . . , H̃k }, where H̃i = ⟨Hi , t | t−1 xt = Φ(x)⟩. In …

The Global Phase Space Of The Three-Vortex Interaction System And Its Application To Vortex-Dipole Scattering, Atul Anurag

Dissertations

This dissertation presents a global reduction of the classical three-vortex problem that is free from coordinate singularities, enabling a comprehensive analysis of the system's dynamics across all circulation regimes.

To achieve this, a two-step symplectic reduction procedure is developed. The first step introduces Jacobi coordinates adapted to the symplectic structure of the vortex system, and the second applies a Lie-Poisson reduction to the resulting system. This formulation eliminates the non-physical singularities associated with collinear vortex configurations and facilitates a global phase space analysis, including a detailed and novel investigation of bifurcations.

Within this reduced framework, all relative fixed points are …

Reduced Order Models Of Hydrodynamically Interacting Flapping Wings, Jose Pabon

Dissertations

Fish schools exhibit a collective behavior and self-organization that is mediated by hydrodynamic interactions between individual fish. However, the long-time evolution of hydrodynamically interacting collectives is challenging to investigate due to the persistent influence of long-lived vortical structures, and the high-resolution requirements of direct numerical simulation at large Reynolds numbers. Reduced-order models have therefore played an important role in theoretical investigations of collectives of swimming bodies. The main results detailed herein are several new reduced-order models of swimmers that self-propel by flapping, i.e., by executing a prescribed periodic rigid body motion. The models are extensions of a discrete-time dynamical system …

Sugar: A Sequence Unfolding Based Transformer Model For Group Activity Recognition, Yash U. Gondkar

Graduate Masters Theses

Large Language Models have improved significantly in the past couple of years due to the adoption of transformers. However, transformers still find it challenging to process videos due to limited context size caused by their quadratic computing cost. Therefore, we studied a booming field in machine learning which powers applications like social scene analysis and video surveillance systems called Group Activity Recognition (GAR). We found that recent models were able to achieve more than 90% accuracy on popular datasets like the Volleyball dataset, however, it turned out that even they relied on transformers.

Therefore, in this work, we developed a …

A Partial Resolution Of Hedden’S Conjecture On Satellite Homomorphisms, Randall Johanningsmeier , '24, Hillary Kim , '25, Allison N. Miller

Mathematics & Statistics Faculty Works

A pattern knot in a solid torus defines a self-map of the smooth knot concordance group. We prove that if the winding number of a pattern is even but not divisible by 8, then the corresponding map is not a homomorphism, thus partially establishing a conjecture of Hedden.

Spectrum Analysis Of Thermally Driven Curvature Inversion In Strained Graphene Ripples For Energy Conversion Applications Via Molecular Dynamics, James M. Mangum, Md R. Kabir, Tamzeed B. Amin, Syed M. Rahman, Ashaduzzaman, Paul M. Thibado

Physics Faculty Publications and Presentations

The extraordinary mechanical flexibility, high electrical conductivity, and nanoscale instability of freestanding graphene make it an excellent candidate for vibration energy harvesting. When freestanding graphene is stretched taut and subject to external forces, it will vibrate like a drum head. Its vibrations occur at a fundamental frequency along with higher-order harmonics. Alternatively, when freestanding graphene is compressed, it will arch slightly out of the plane or buckle under the load. Remaining flat under compression would be energetically too costly compared to simple bond rotations. Buckling up or down, also known as ripple formation, naturally creates a bistable situation. When the …

Corrigendum To "Face-Magic Labelings Of Polygonal Graphs", Wai Chee Shiu, Richard M. Low, Andy K. Liu

Theory & Applications of Graphs

In this note, we correct a misstatement of a theorem.

Trigonometry: A Brief Conversation, Carolyn D. King Phd, Evelyn Tam, Fei Ye Phd, Beata Carvajal

Open Educational Resources

These five units are specifically tailored to foster the mastery of a few selected trigonometry topics that comprise the one credit MA-121 Elementary Trigonometry course.  Each unit introduces the topic, provides space for practice, but more importantly, provides opportunities for students to reflect on the work in order to deepen their conceptual understanding.

These units have also been assigned to students of other courses such as pre-calculus and calculus as a review of trigonometric basics essential to those courses.  This is the third edition of the materials.  Based on suggestions from instructors Units 2 and 3 have been edited to …

Murmurations Of Modular Forms And P-Power Coefficients, Debanjana Kundu, Katharina Müller

School of Mathematical & Statistical Sciences Faculty Publications

We extend the work of N. Zubrilina on murmuration of modular forms to the case when prime-indexed coefficients are replaced by squares of primes. Our key observation is that the shape of the murmuration density is the same.

Structural And Computational Results On Equitably Dissectible Graphs, Ann Wells Clifton

Doctoral Dissertations

This dissertation introduces the class of equitably dissectible graphs — graphs whose vertex set can be recursively partitioned into two parts whose sizes differ by at most one where the two induced subgraphs are connected. In Chapter 2, we show that a graph is equitably dissectible if and only if it has a spanning tree that is equitably dissectible, and we use this result to establish connections between the class of equitably dissectible graphs and Hamiltonian graphs. We also fully characterize the equitably dissectible spiders of the form S3(a) and S3(a, b), identifying a family of unruly spiders that are …

A Backtracking Algorithm For Determining The Existence Of Regular Graphs Of Specified Girth And Excess, Stetson Ray Bosecker

Doctoral Dissertations

The study of cages focuses on finding (k, g)-graphs of minimal order. This dissertation generalizes the problem of finding cages to the determination of graphs with specified excess, thereby broadening the significance of the results. The (k, g, ε)-graph problem seeks to determine the existence or nonexistence of k-regular graphs with girth g and excess ε = n(G)−M(k, g) (where M(k, g) represents the Moore bound for cage graphs). Motivated by heuristic methods used to determine properties within the study of cages, we present a backtracking algorithm capable of constructing (k, g, ε)-graphs or determining their nonexistence. Chapter 2 provides …

Privacy-Preserving Structure Learning For Geospatial Data Using Information-Theoretic Dependency Measures, Ahmed Mudhish

Doctoral Dissertations

This dissertation proposes a privacy-preserving framework for structure learning in Bayesian networks (BNs) that addresses the challenges of distributed geospatial data face. Geospatial datasets often exhibit region-specific patterns such as sparsity and nonlinear dependencies. These patterns undermine the effectiveness of traditional machine learning models. Additionally, learned BN structures may reveal sensitive relationships in the generated graph by BNs. These relationships pose a significant privacy risk if reverse-engineered. To address these issues, three novel algorithms are introduced. First, the Selective Naïve Bayes with HSIC (SNB-HSIC) algorithm applies a kernel-based dependency measure to filter redundant and irrelevant features in sparse datasets, improving …

Betti Numbers For Modules Over Artinian Local Rings, Kaiyue He

Dissertations - ALL

We study the behavior of Betti growth of modules over Artinian rings under some $\Tor$ vanishing conditions. Let $(R,\fm)$ be a local Artinian ring with a fixed ideal $I$, and $M$ a finite module. We extend the framework developed in \cite{huneke2014vanishing} by introducing and analyzing a new invariant, $\gamma_I(M)$ (see Definition \ref{definition}), associated with the ideal $I$ of the ring $R$ and a finitely generated $R$-module $M$. It turns out that this invariant $\gamma_I(M)$ provides an upper bound for the ratio of certain consecutive Betti numbers of the finitely generated modules $N$ such that $\Tor_i(M,N) = 0$ for some $i …

Project-Based Learning With Odes: Modeling Straw Rocket Motion With Air Resistance, Viktoria Savatorova, Ethan Dyer, Aleksei Talonov

CODEE Journal

This paper presents a hands-on project that guides students through building and validating a mathematical model of projectile motion. The project starts with the idealized case of motion under gravity without air resistance and then introduces air drag : first as a linear force, and then as a nonlinear quadratic force, with the Reynolds number providing the justification for the quadratic model. Students perform experiments with vertical and angled launches, capturing and analyzing motion data using video analysis software. Vertical launch data allows parameter estimation via least squares fitting of the nonlinear drag model, yielding values for initial velocity and …

Degeneracies Of Triangulated Graphs, Allan Bickle

Theory & Applications of Graphs

A graph $G$ is $k$-degenerate if each subgraph has minimum degree

at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest

$k$ such that $G$ is $k$-degenerate. We determine the truth values

of four statements (using different quantifiers) about when a planar

graph $G$ with degeneracy $k$ has a triangulation with degeneracy

$l$. We characterize which 3-connected planar graphs can only be

triangulated to degeneracy 3. Then we consider analogous questions

for maximal planar bipartite graphs. We prove some structural results

on these graphs, including results on decomposition of planar graphs

into various types of bipartite graphs.

Universal Centralizers, Morita Abelianization, And Wonderful Models In Lie Theory, Peter Crooks

Funded Research Records

No abstract provided.

Numerical Results Of New And Modified Heuristics For The Vertex Coloring Problem, Elliot Hanson

Summer Research Showcase

The chromatic number, χ(G) of an undirected graph G=(V,E) is the minimum number of colors required to color its vertices so that no two adjacent vertices have the same color. Given a graph, G, finding its chromatic number is useful for solving scheduling problems and other combinatorial optimization problems. However, determining the chromatic number of a connected graph is NP-Hard, meaning there is no known polynomial time algorithm which solves it. Thus, we are interested in heuristic solutions which give approximations for the chromatic number in polynomial time. There are well-known heuristics for finding χ(G) for any graph G. …

The Fermat Quartic X4 + Y4 = 2m In Quadratic Number Fields, Jayanth Athipatla

Mathematics Faculty Publications

In this paper, we generalise to the family of Fermat quartics X4+Y4=2m,m∈Z, a result of Aigner [‘Über die Möglichkeit von x4+y4=z4 in quadratischen Körpern’, Jahresber. Deutsch. Math.-Ver. 43 (1934), 226–228], which proves that there is only one quadratic field, namely Q(−7−−−√), that contains solutions to the Fermat quartic X4+Y4=1. The m≡0(mod4) case is due to Aigner. The m≡2(mod4) case follows from a result of Emory [‘The Diophantine equation X4+Y4=D2Z4 in quadratic fields’, Integers 12 (2012), Article no. A65, 8 pages]. This paper focuses on the two cases m≡1,3(mod4), classifying for m≡1(mod4) the infinitely many quadratic number fields that contain solutions, …

Career: Algebra And Representation Theory For Non-Semisimple Topological Field Theory, Matthew Young

Funded Research Records

No abstract provided.