Mathematics Commons^™

Memoir On A General Property Of A Very Extensive Class Of Transcendental Functions, Niels Henrik Abel 1802--1829, John Little

Mathematics and Computer Science Department Faculty Scholarship

We present this new commentary and translation anticipating the 200th anniversary of the work, commonly known as Abel's ``Paris memoir.'' This is recognized today as one of Abel's most original and influential works. It is significant mostly because it marked the first appearance of a form of a result in the theory of algebraic curves and Riemann surfaces that has come to be known as ``Abel's theorem.'' However, Abel's original understanding of the meaning and context of his result was quite different from the typical modern formulation and the development of the modern understanding has been a long and tortuous …

Constructions Of Compact Dupin Hypersurfaces With Non-Constant Lie Curvatures, Thomas E. Cecil

Mathematics and Computer Science Department Faculty Scholarship

A hypersurface M in the unit sphere Sⁿ ⊂ Rⁿ⁺¹ is Dupin if along each curvature surface of M, the corresponding principal curvature is constant. If the number g of distinct principal curvatures is constant on M, then M is called proper Dupin. In this expository paper, we give a detailed description of two important types of constructions of compact proper Dupin hypersurfaces in Sⁿ. One construction was published in 1989 by Pinkall and Thorbergsson [35], and the second was published in 1989 by Miyaoka and Ozawa [26]. Both types of examples have the …

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

Traffic Prediction For Research And Education Networks: Anomaly-Aware Deep Learning And Benchmarking, Mohammad Arafath Uddin Shariff

School of Computing: Dissertations, Theses, and Student Research

Research and Education Networks (RENs) and High-Performance Computing (HPC) environments are critical infrastructures for modern scientific discovery, demanding sustained high-throughput and low-latency data transfers. Unlike commercial networks, RENs exhibit unique traffic characteristics, including predominant “elephant flows,” inherent burstiness, and complex temporal-spatial dynamics often decoupled from human-driven cycles. Traditional traffic forecasting methods, tailored for commercial Wide Area Networks (WANs), consistently fail to capture these distinct REN dynamics, leading to inefficient resource management and potential impediments to scientific progress.

This thesis addresses this critical gap by developing and validating a robust, scalable, and anomaly-aware traffic forecasting framework specifically tailored for REN/HPC networks. …

Rethinking Iterative Proportional Fitting: Scalable And Hybrid Approaches To Joint Distribution Fitting, William Ofosu Agyapong

Open Access Theses & Dissertations

The Iterative Proportional Fitting (IPF) algorithm is widely used in contingency table estimation, survey weighting, and synthetic population generation due to its simplicity and strong theoretical foundation for matching observed marginal distributions. However, in high-dimensional settings, IPF faces substantial computational and memory demands, as well as statistical instability caused by sparse contingency tables. Moreover, IPF is less useful in modern population synthesis tasks that require both scalability and realism because, despite its superiority in matching known marginal distributions, it cannot produce realistic out-of-sample data points. To address these limitations, we first propose a blockwise IPF framework, in which the feature …

Laser Scan Path Design For Controlled Microstructure In Additive Manufacturing With Integrated Reduced-Order Phase-Field Modeling And Deep Reinforcement Learning, Augustine Twumasi

Open Access Theses & Dissertations

Laser Powder Bed Fusion (L-PBF) is a well-established additive manufacturing technique for fabricating intricate metal components with exceptional precision. A significant challenge in L-PBF is the formation of complex microstructures that influence final material properties. We propose a physics-guided, machine learning-aided approach to optimize scan paths for desired microstructure outcomes, such as equiaxed grains. We employed a phase-field method (PFM) to model the evolution of the crystalline grain structure. To reduce computational costs, we trained a surrogate machine learning model, a 3D U-Net convolutional neural network, using single-track phase-field simulations with varying laser powers to predict crystalline grain orientations based …

Algebraic Multigrid Methods For Nonsymmetric And Indefinite Problems: Theory And Applications, Ahsan Ali

Mathematics & Statistics ETDs

Algebraic multigrid (AMG) is a well-established and highly efficient solver for symmetric positive definite (SPD) systems arising from elliptic and parabolic PDEs, while nonsymmetric systems from hyperbolic PDEs remain a significant challenge. This dissertation develops AMG methods and theory for nonsymmetric problems. First, we develop a novel approach combining mode constraints from energy-minimization AMG with local approximations of ideal restriction in $\ell$AIR, resulting in constrained $\ell$AIR (C$\ell$AIR), which demonstrates scalable convergence across advective and diffusive problems. Second, we extend optimal AMG theory by deriving spectral radius estimates for the two-grid error transfer operator using matrix-induced orthogonality, enabling convergence predictions for …

Modern Procedural Terrain Generation Techniques And Their Background, Hunter A. Barton

2025 Symposium

Procedural terrain generation has become a staple in many digital environments, enabling the automated creation of large-scale and realistic landscapes for applications such as video games and movies. This paper provides an in-depth look at smooth noise functions and their use for terrain generation, as well as an overview of some more modern methods of generation. A method utilizing machine learning stlye transfer was reproduced for this paper with some alterations to improve visualization and realism.

Exact Sampling Of The Six-Vertex Model Using Coupling From The Past, Malaeka Amir

DePaul Discoveries

This paper aims to explore the six-vertex model through simulations designed to investigate the behavior of configurations under specific domain wall boundary conditions. To generate random configurations, we employ the Markov Chain Monte Carlo method while addressing the challenge of mixing times by utilizing the Coupling from the Past (CFTP) algorithm. Implemented in Python, our approach leverages CFTP to ensure exact sampling, avoiding the uncertainty of convergence in traditional Monte Carlo methods. We explore the monotonicity property within this framework and prove that it is only maintained by the steps of this algorithm for very particular values of the parameters.

Exploring Communication In Multi-Agent Cooperative Reinforcement Learning, Matthew Kalarickal

Math and Computer Science Honors Theses

This work focuses on communication strategies within a cooperative multi-agent reinforcement learning system. The goal is to explore how communication can be used among agents to potentially improve performance. The research operates within the scope of “learning tasks with communication,” where the primary aim is to solve domain-specific tasks through information exchange using explicit communication protocols. Three distinct communication strategies were implemented and explored: Combinatorial Ghost, Feature Sharing Ghost, and Move Sharing Ghost. Fully Centralized Training and Execution and Centralized Training with Decentralized Execution training approaches were based on the different communication strategy used. Performance metrics were recorded for these …

Machine Learning: Neural Networking With Relu And Optimization, Aidan Redmond Brownell

Undergraduate Theses, Capstones, and Recitals

At its core, learning is an algorithmic process: it begins with input data, undergoes a series of transformations or computations, and yields an output intended to solve a specific task. This output is then compared against a target or desired result, and the internal mechanisms are updated based on how well the output aligns with expectations. While this feedback-driven process occurs almost effortlessly in humans, it is a far more structured, deliberate, and computationally intensive undertaking for machines.

Basic Theory And Implementations Of Quantum Error Correction, Derek Rodriguez

Undergraduate Theses, Capstones, and Recitals

The introduction of quantum computing has presented algorithmic solutions to computationally difficult challenges that are far more efficient than those of classical computers. These algorithms leverage the properties of quantum mechanics to manipulate the quantum properties of subatomic particles, requiring immense precision and stability. Current quantum hardware, however, is too noisy and introduces too many errors for these algorithms to be useful in practice, necessitating the use of error correction algorithms. This field survey seeks to introduce various principles of quantum mechanics relevant to quantum computing and quantum error correction (QEC), detail the implementation and motivations of a basic QEC …

Notes On The Invariance Of Tautness Under Lie Sphere Transformations, Thomas E. Cecil

Mathematics and Computer Science Department Faculty Scholarship

An embedding ϕ : V → Sⁿ of a compact, connected manifold V into the unit sphere Sⁿ ⊂ Rⁿ⁺¹ is said to be taut, if every nondegenerate spherical distance function d_p, p ∈ Sⁿ, is a perfect Morse function on V , i.e., it has the minimum number of critical points on V required by the Morse inequalities. In these notes, we give an exposition of the proof of the invariance of tautness under Lie sphere transformations due to ´Alvarez Paiva. First we extend the definition of tautness of submanifolds of S …

Forecasting Influenza Rates Using Machine Learning: A Study Of Chatgpt's Predictive Accuracy, Sara Saleh

University Honors Theses

This study evaluates ChatGPT's ability to forecast influenza rates, such as the number of flu cases, hospitalizations, and death during peak season periods using CDC data, and comparing forecasts against actual results to calculate statistical accuracy and consistency. Influenza forecasting is essential for public health planning, but traditional methods may not always provide timely or accurate predictions. In this research study, ChatGPT was utilized to predict the influenza rates for the following week based on the previous week's data obtained from the FluView surveillance system. The predicted rates were compared to the actual influenza rates to assess the model's overall …

The Other Side Of The Equation: De-Simplification, A Prerequisite For Calculus, Stephen L. Brown

ACMS Conference Proceedings 2005

No abstract provided.

Property Testing Ai: An Efficient Frontier, Paul Sopher Lintilhac

Dartmouth College Ph.D Dissertations

In this dissertation, we take a step towards addressing the major problem of a lack of standardized and rigorous approaches to testing and evaluation of AI systems. Taking inspiration from both the fields of Property Testing and Property Based Testing (for programs), we develop a novel taxonomy of partially overlapping classes of properties of AI systems, including simple properties, compound properties, higher order properties, data relation properties, and architecture-utility properties. We argue that this taxonomy categorizes a diverse set of AI traits -- including accuracy, fairness, robustness, monotonicity, point-wise and global privacy properties, sensitivity, and more -- according to the …

On The Design Of A Framework For Large-Scale Exploratory Graph Analytics, Oliver Andres Alvarado Rodriguez

Dissertations

Large-scale exploratory graph analytics merges data science with high-performance computing to extract critical insights from network-representable data. Data scientists routinely analyze data from the natural, social, and computing sciences by representing it as networks, or graphs, where objects become vertices and their relationships become edges. This representation allows data scientists to add graph analytics to their toolbox. However, designing tools for large-scale exploratory graph analytics is challenging due to the complexities of graph algorithms, such as high communication in distributed systems and large memory demands. These challenges can lead to overly complex software, which limits usability and development to a …

From Neural Networks To Large Language Models: Innovations In Financial Ai, Mathematical Reasoning, And Structured Data Representation, Junyi Ye

Dissertations

This dissertation explores the evolution and application of artificial intelligence techniques across three critical domains: financial modeling, mathematical reasoning, and structured data analysis. The dissertation presents seven research projects that chart a progression from specialized neural architectures to sophisticated large language models (LLMs), contributing novel methodologies and frameworks at each stage.

In the financial domain, the research first introduces TS-Mixer, a MLP-based architecture for time-series forecasting that captures both feature relationships and temporal dependencies through a simple yet effective design, outperforming more complex models in S&P500 index prediction. The dissertation then presents DySTAGE, a dynamic graph representation learning framework that …

Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam

Computer Science ETDs

We develop distributed robotics algorithms with analytical tools needed to define and analyze angle turned and distance traversed by robots executing geometric algorithms. We then use these analytical tools to obtain information, via sensor measurements, about an a priori unknown surface. Our contributions are threefold. First, we develop the Sketch Algorithm, which estimates the boundary of any unknown contour and is asymptotically optimal in terms of distance traversed and angle turned. Second, we present experimental field work that validates the Sketch Algorithm. Finally, we propose an approach to find multiple sources of a surface with potential applications to approximate that …

Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr

Theses and Dissertations

A foundational idea in mathematics lies in breaking down existing components into their bare fundamentals. As evidenced by prime numbers and composites, we learn this idea at an early age. Categorizing these broken-down components into their simplest form allows mathematicians to construct proofs from emergent patterns. John Conway’s Atlas of Finite Groups in the 1990s was particularly concerned with the categorization of structures known as groups. There are certain axioms a group must adhere to, which amount to the retention of symmetry; ultimately a group helps us to better understand symmetric actions performed on a set with a binary operation. …

Modeling Literary Connections: Exploring Transregional Resistance In Dalit Poetry, Antara Bhattacharyay

Mathematics, Statistics, and Computer Science Honors Projects

Structuring socio-political identities, the caste system (a graded form of hierarchy) remains entrenched in contemporary Indian society. Dalits, marginalized by the caste system, have expressed their resistance through literature, envisioning substantive equality and social change. In this thesis, I draw on digital humanities methods to examine regional variation in translated Dalit poetry from Bengali, Hindi/Urdu, Marathi, and Tamil languages. I utilize topic modeling—a machine learning algorithm that detects latent semantic structures in a text—as a point of departure for poetry analysis. I observe how topic modeling enables newer readings of the poems, revealing regionally resonant and broader Dalit themes.

Computer Vision In Soccer: Yolov11 Analytics Engine For Quantifying Game Strategy, Connor S. Maurer

Data Science Undergraduate Honors Theses

Single-shot object detection capabilities significantly reduce computational overhead for real-time computer vision in sports analytics at 60 FPS. YOLO11’s lightweight CNN gives promising accuracy while meeting the low-latency demand of dynamic soccer matches. As data-driven approaches take over the sport of soccer, efficient player tracking systems become critical for informing coach’s strategies. I prototype the ETL (Extract, Transform, Load) process of data collected from a single- shot detection program and evaluate its viability for estimating player fatigue. YOLO11 detects players, the ball, and other characteristics, with the output transformed by homography to estimate the positions in the real world. These …

A Study Of Knots And Quandles, Zhaoqi Wu

Math and Computer Science Honors Theses

We explore the mathematical theory of knots through the lens of algebraic structures known as kei and quandles. We begin by introducing classical knot invariants and then study the fundamental kei of a knot as a tool for distinguishing knot types. We generalize this approach using various kinds of quandles, including Alexander and dihedral quandles, and investigate their associated polynomial invariants. We also examine the connection between quandles and group theory, as well as their algebraic representations in quandle rings. Moreover, we analyze idempotent elements in quandle rings over finite fields, providing both general results and specific examples.

Maximal Independent Set Algorithms Within Procedural Planar Maps: A Large-Scale Evaluation, Chaucer Ihrig

Honors College Theses

Analysis of a childhood game has led us to the problem of maximum independent sets in planar graphs. We wrote a graph creation utility using R to generate a random planar map and its dual graph. This utility then finds a graph’s maximal independent set using a variety of six algorithms. We investigate statistical connections between graph structure, colorability, and the maximal independent sets found using these algorithms over an incredibly large and procedurally generated dataset. We find one can always win the coloring game if the resultant graph is two-colorable. The algorithms perform statistically and practically significantly better on …

Stability Analysis Of Turbulent Fluid Flow, Adam D. Schroeder

Mathematics, Statistics, and Computer Science Honors Projects

Hydrodynamic stability refers to the study of when and how laminar flows transition to turbulence. This includes investigations of the mechanisms of transition, as well as the classification of known flow configurations as either stable or unstable and the identification of critical values of flow parameters at which this bifurcation occurs. In this thesis, we introduce the mathematical theory behind continuum mechanics and fluid dynamics as well as some tools from the study of dynamical systems. We apply these concepts to the linear stability analysis of zero pressure gradient flat plate flow via numerical simulations in OpenFOAM, discussing both the …

Multiscale Integration Of Receptor-Ligand Dynamics Into Discrete And Continuous Tumor Growth Models With Application To Tyrosine Kinase Inhibitor Treatment, Romasa Qasim

Open Access Theses & Dissertations

The epidermal growth factor (EGF) receptor cascade plays a crucial role in the survival and proliferation of tumor cells. Tyrosine kinase inhibitors (TKIs) are a class of drugs that inhibit epidermal growth factor receptors (EGFRs), thereby preventing the downstream signal transduction. Despite their importance, models that link spatial receptor dynamics to tumor growth remain scarce. Further, TKIs act through selective mechanisms, inhibiting active, inactive, or all receptor states, which poses a challenge to traditional modeling approaches.

We propose to numerically study two mathematical models incorporating receptor-dynamics into cancer models to describe the impact of EGFR overexpression and TKIs. The first …

2025 Acssc Program, Acssc Planning Committee

Annual Celebration for Student Scholarship and Creativity

No abstract provided.

Designing A Statistical Plan For Measuring Self-Efficacy Using A 2k Factorial Design​, Rachel A. Hart, Eugene H. Thompson

Mathematics, Computer Science & Statistics Presentations

This study focuses on designing a statistical plan that measures the effects of self-efficacy using a 2k factorial design. Specifically, we simulated data on physical, mental, spiritual, and social health, so we could focus on their interaction with self-efficacy. By using ANOVA to see the main and interaction effects, we can see the impact of individual autonomy on health. Our findings show the need for experimental data on the demographic of interest, peri-and post-menopausal women.