Mathematics Commons^™

Adaptive Rational Approximation In Dynamic Economic Models: A Novel Application Of The Aaa Algorithm To Economic Growth, Adaye Sosthene Yvan N'Guettia

Mathematics, Statistics, and Computer Science Honors Projects

I study adaptive rational approximation for fixed points that arise in infinite-horizon dynamic programming. I integrate the Adaptive Antoulas–Anderson (AAA) algorithm into Bellman- and Euler-based fixed-point solvers by recomputing a barycentric rational interpolant at each update. In addition to standard AAA, which selects support points from interpolation residuals, I study a residual-weighted variant in which Bellman,Euler, or KKT diagnostics act as secondary weights on the greedy pivot rule. This alignment of approximation adaptivity with the underlying equilibrium conditions can concentrate degrees of freedom in regions of steep curvature, sharp transitions in localbehavior, and other localized features that typically degrade polynomial …

An Analysis Of The Effects And Implementations Of The Early Literacy Grant In Arizona, Alicia Severiano Perez

Mathematics, Statistics, and Computer Science Honors Projects

Over the years, states have implemented Science of Reading (SoR) frameworks to address low literacy levels. The Early Literacy Grant (ELG) in Arizona funds and supports such frameworks for schools serving low-income students. This paper is the first to explore the grant through interrupted time series modeling to evaluate effectiveness and text analysis to understand its implementation. We do not find clear evidence of positive effects caused by the grant, other than some cases, such as Yuma County. Schools typically allocate funds toward salaries and hiring instructors. These findings raise questions about whether its allocations should be closely monitored.

Level Sets For Lehmer Codes Of Pattern Avoiding Permutations, Avery Sinclair

Mathematics, Statistics, and Computer Science Honors Projects

We study the poset structures for two families of pattern avoiding permutations. An n-permutation is a list of the numbers [n]={1,2,...,n}. A permutation is 321-avoiding when it does not contain a decreasing subsequence of length 3. A poset (partially ordered set) is a set such that some elements can be compared with one another. Using Lehmer codes, we define a poset for 321-avoiding permutations. We then fully describe the six lowest levels of this poset. We then consider the analogous poset for 123-avoiding permutations (which don't contain an increasing subsequence of length 3) and fully describe the three lowest levels.

Determinants And Invertibility In Finite Modular Systems, Osasu Omobude

Discovery Day - Daytona Beach

This project investigates determinants and matrix invertibility in finite modular systems, focusing on matrices over Zn. Using the Hill cipher as context, it examines the algebraic conditions under which a matrix is invertible in modular arithmetic. In particular, the project studies how the determinant determines invertibility, showing that a matrix over Zn is invertible if and only if its determinant is coprime with n.   The project further compares invertibility over the real numbers with invertibility over modular systems, highlighting the distinction between prime moduli Zp and composite moduli. In the prime case, matrices behave similarly to those over fields, where …

Rockin’ Rover On The Rainbow Road, Michael Kolta, Lawrence Burgee, Ying Yuan

Transformations

This paper presents a progressive series of age-appropriate lesson plans for grades K-12 that all use the same interdisciplinary activity to educate students about Science, Technology, Engineering, Art, and Mathematics (STEAM) simultaneously. Technology from Texas Instruments (TI) was employed including a TI Nspire graphing calculator that can run Python programs, a TI Innovator Hub, and a TI Rover. The TI Rover is a small, robotic car that has sensors and is controlled by the calculator via the Hub hardware interface. A Python program was developed that uses the color sensor in the Rover to detect the color on colored paper …

Machine Learning For Predictive Energy And Emissions Modeling Of Vehicles And Power Grids In The United States, S M Tanvir Faysal Alam Chowdhoury

Dissertations

The environmental benefits of electric vehicle (EV) adoption depend on more than replacing internal combustion engine vehicles with electric powertrains. EV adoption reshapes electricity demand, interacts with regional generation mixes, and influences travel behavior and congestion, creating a coupled transportation-energy system in which vehicle and power-plant emissions must be evaluated together. This dissertation develops machine-learning frameworks for predicting energy consumption and emissions from vehicles and power grids under rising EV adoption. The first component forecasts grid emissions from EV charging. Using simulation data from NREL's Cambium database, a Prophet-based time-series framework predicts carbon dioxide, nitrous oxide, and methane emission rates …

Observations On Recurrent Loss In The Neural Network Model Of A Partial Differential Equation: The Advection–Diffusion Equation, Jonah A. Reeger

Faculty Publications

A growing body of literature has been leveraging techniques of machine learning (ML) to build novel approaches to approximating the solutions to partial differential equations. Noticeably absent from the literature is a systematic exploration of the stability of the solutions generated by these ML approaches. Here, a recurrent network is introduced that matches precisely the evaluation of a multi-step method paired with a collocation method for approximating spatial derivatives in the advection–diffusion equation. This allows for two things: (1) the use of traditional tools for analyzing the stability of a numerical method for solving PDEs and (2) bringing to bear …

Cdt-1d Cnn Integration With Simpson-Sobolev Regularization For High-Frequency Options Trading: With Fem-Based Heston Option Pricing, Daniel M. Margolis, Johannes Tausch, Arthur K. Selender

Mathematics Theses and Dissertations

This dissertation presents a computational framework for high-frequency options trading that combines Cross-Data-Type 1-D Convolutional Neural Networks (CDT-1D CNN) with Simpson-Sobolev regularization for directional prediction, and finite element methods (FEM) for realistic option pricing during backtesting. The core innovation lies in developing a mathematically rigorous regularization approach that maintains the adaptability of modern deep learning while enabling accurate evaluation through stochastic volatility models. The primary contribution is the Simpson-Sobolev regularization scheme, which extends traditional Sobolev regularization by incorporating Simpson’s rule for numerical integration. This approach achieves higher-order accuracy in approximating the Sobolev norms that control function smoothness. Simpson’s rule attains …

Cardiovascular Disease Subtypes And Alzheimer's Disease: Phenotypic And Genetic Associations In The Uk Biobank And All Of Us Research Program, Aili Toyli, Chen Zhao, Kuan Jui Su, Hui Shen, Hong Wen Deng, Qing Hui Chen, Qiuying Sha, Weihua Zhou

Michigan Tech Publications

BACKGROUND: Cardiovascular disease (CVD) and Alzheimer's disease (AD) are major public health concerns that share overlapping risk factors and potential mechanistic pathways. Although vascular contributions to cognitive decline are well documented, the specific relationships between AD and different CVD subtypes remain poorly understood. METHODS: In this cross-sectional study, we examined associations between AD and 11 CVD subtypes using logistic regression models in 2 large biobanks: the UK Biobank (n=502 133) and the All of Us Research Program (n=287 011). Models were adjusted for demographic, lifestyle, and clinical covariates. We also explored genetic overlap between AD and CVD traits through proximity-based …

Uniform Stability Of Katyusha In Strongly-Convex Settings, Don Li

University Honors Theses

Acceleration of convergence and reduction of variance constitute a trade-off in the design of stochastic optimization machine learning algorithms. Katyusha was introduced to address this trade-off, synthesizing Nesterov Accelerated Gradient (NAG) and Stochastic Variance-Reduced Gradient (SVRG) into a single first-order optimizer with promising empirical performance. However, the generalization properties of Katyusha remain largely unexplored. We conjecture that, in the smooth quadratic regime (i.e., under assumptions of strong convexity and smoothness of the loss function, and boundedness of gradients), Katyusha is uniformly stable in the sense of Bousquet and Elisseeff. Instantiating our framework for NAG, we extend the use of Lyapunov …

Obstructions To Some Injective Oriented Colourings, Russell J. Campbell, Nancy E. Clarke, Gary Macgillivray

Theory & Applications of Graphs

Each of several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ leads to an injective oriented colouring problem. For each case in which such a problem is solvable in polynomial time, we identify a set $\mathcal{F}$ of oriented graphs such that an oriented graph $G$ has an injective oriented colouring with the given number of colours if and only if there is no $F \in \mathcal{F}$ for which there is a locally-injective homomorphism of $F$ to $G$.

Computational Insights Into Nucleosome Dynamics In Epigenetics Using Molecular Dynamics Simulations, Rutika Patel

Dissertations, Theses, and Capstone Projects

Nucleosome core particles (NCP) are the building blocks that form a highly organized and compact chromatin structure. Nucleosomes package DNA in the nucleus of eukaryotic cells. The NCP consists of about 147 base pairs of DNA wrapped around the histone octamer, with 1.65 superhelical turns in a left-handed manner. The histone octamer is composed of two copies of H3, H4, H2A, and H2B. Together with histone H1 and linker DNA, they further assemble into a higher-order chromatin structure. The nucleosome complex is stabilized by electrostatic interactions between positively charged histone residues and the negatively charged DNA backbone. To effectively access …

Comparing The Sensitivity And Degree Of Boolean Functions Via The Hypercube, Anne-Caroline Rupp

University Honors Theses

This thesis studies three complexity measures of total Boolean functions f:{0,1}ⁿ → {0,1}: maximum sensitivity s(f), polynomial degree deg(f), and spectral sensitivity λ(f), where λ(f) is defined as the spectral norm of the adjacency matrix of the sensitivity graph. Building on the results of Aaronson et al., we examine the inequality chain √s(f) ≤ λ(f) ≤ deg(f) and investigate whether all three quantities can be simultaneously equal.

The first part of the thesis reverse engineers the equality cases of the two known inequalities to isolate necessary extremal conditions on both the Fourier structure of f and the local geometry …

Differential-Geometric Methods For Neural Signed Distance Fields: Parameterized Surface Extraction And Curvature Regularization For Cad Models, Haotian Yin

Dissertations

Neural signed distance fields have emerged as a powerful framework for representing three-dimensional geometry through continuous and differentiable neural functions. Their flexibility, resolution independence, and compatibility with gradient-based optimization make them especially attractive for surface reconstruction and geometric learning. However, despite these advantages, two fundamental challenges remain for engineering-grade applications. First, higher-order geometric properties such as curvature are difficult to model reliably during training and often require computationally expensive second-order differentiation. Second, while neural signed distance fields provide implicit surface representations, they do not directly yield a globally consistent forward map or parameterization for downstream geometric processing.

This dissertation addresses …

A Symbolic Model Of Proof Acquisition In Act-R, Beckett Morris, Kerstin Haring

DU Undergraduate Research Journal Archive

Learning to construct mathematical proofs—formal arguments demonstrating the truth of a mathematical statement using logical deductions and previously established facts—is one of the most challenging skills in STEM education. This research aims to build the foundations for a symbolic cognitive model, using the ACT-R cognitive architecture and implementing in Python with the pyactr package, to explore how different proof strategies can be thought through with only symbols and rules. The model observes simple proofs, and its abilities are assessed based on its generalization capabilities, efficiency, and error patterns. By developing and analyzing such a model, this research provides new insights …

Classes Of Analytic Functions Defined By Salagean Derivative Operator Associated With Neutrosophic Generalized Poisson Distribution, Soliu O. Opeyemi Okunola, Olushola Adeyemo, Sayo A. Abidemi Gbangbala, Folorunso I. Isola Akinwale

Neutrosophic Systems with Applications

This study introduces and analyses new subclasses of analytic functions by applying the Salagean derivative operator to the Neutrosophic Generalized Poisson Distribution (NGPD) series. We develop a model where the mean parameter is treated as an interval or set to account for indeterminacy in complex systems. By employing Stirling numbers of the second kind and decreasing factorials, we derive necessary and sufficient coefficient inequalities and inclusion relations for these new subclasses. Numerical results and graphical illustrations demonstrate the sensitivity of these functions to orientation and the neutrosophic parameter, providing a framework for applications in fields like medical imaging and network …

Conditional Product Sampling For Gaussian Process Implicit Surfaces, Song Shi

Dartmouth College Master’s Theses

Gaussian Process Implicit Surfaces (GPISes) provide a powerful and unified stochastic geometry representation for rendering surfaces, volumes, and the rich continuum between them. Recent work has shown that GPISes can model a broad space of visual appearances under a unified light transport framework. However, practical rendering with GPISes remains challenging: existing estimators can become inefficient for particular correlation structures, and highly anisotropic or heightfield-like GPISes require specialized treatment to obtain robust variance reduction.

This thesis extends recent work on GPIS rendering by introducing a new next-event estimation (NEE) technique for anisotropic GPISes.We show that standard NEE provides diminishing benefits as …

Degrees Of Access: The Role Of Family Education In Applying To Graduate School, Emma Tweed

Math and Computer Science Honors Theses

Access to graduate education in the United States remains heavily stratified by structural, financial, and informational barriers. While undergraduate first-generation student outcomes are widely studied, fewer structural analyses examine how graduate-level “educational inheritance” shapes prospective applicants' navigational capital, particularly within competitive STEM fields like mathematics. Drawing upon theories of social capital and the “hidden curriculum,” this study investigates the relationship between an individual's knowledge of the graduate school application process and the highest level of education attained by an immediate family member.

Using the Knowledge-GAP survey instrument funded by the National Science Foundation, data were collected from a diverse sample …

Largest 2-Regular Subgraphs In Complete S-Partite Graphs, Yiyang Jiang

McKelvey School of Engineering Graduate Student Theses & Dissertations

In this thesis, we focus on the class of complete $S$-partite graphs, for $S$ an undirected graph possibly with self-loops, and address the problem of finding largest $2$-regular subgraphs of these graphs, which can be formulated as an integer linear program. Roughly speaking, a complete $S$-partite graph is obtained by replacing every single node of $S$ with a number of nodes, preserving the edge/non-edge relations of $S$. Our motivation in studying largest $2$-regular subgraphs is rooted in the structural systems theory, particularly in the problem of finding largest subnetworks that can sustain controllability or asymptotic stability of the corresponding subsystems. …

Towards Improving The Performance Of The Adcirc Storm Surge Modeling Software, Nick Weldner, Tim Stitt, Jijun Tang

Caravel Undergraduate Research Journal

Accurately predicting storms and hurricanes is critical to saving lives and reducing economic loss. Therefore, it is necessary to use the most efficient software and hardware technology available in order to improve the performance and fidelity of these predictive mathematical models. For over ten years, the Computational Hydraulics Lab (CHL) at the University of Notre Dame has been involved in developing the high-resolution ADvanced CIRCulation (ADCIRC) storm surge model to predict storm surges in coastal areas. The objective of the work reported here was to port a novel adaption of the parallel ADCIRC code to the state-of-the-art Intel Xeon Phi …

Volume 17, Christian O’Neill, Kyara Greene, Savva Sidorov, Laura Bisaillon, Luke Clemmer, Hannah Gordon, Kitt Benson, Taylor Blount, Rachel Danzitz, Nicholas Duellman, Chase Gionis, Hima Fernando, Seth Franzyshen, Onyx Gonzalez, Bryan Lin, Samantha Start, Ysabel Wells, Maggie Duncan

Incite: The Journal of Undergraduate Scholarship

Introduction Dr. Amorette Barber, Director, Office of Student Research

From the Editor Dr. Hannah Dudley-Shotwell

Cover Artist’s Statement Maggie Duncan

On Mentoring Dr. Yulia Uryadova

Ukrainian Resistance in the Face of Russification: Nestor Makhno and Anarchism

by Christian O’Neill

Life Vest by Kyara Greene

Isolation and 16S rRNA Identification of Bacteria from Fire Department Connection Pipe by Savva Sidorov

The Effectiveness of Planned Exercise in Reducing ADHD Symptoms in Children by Laura Bisaillon & Luke Clemmer

Linguistic Analysis on Confidence and Communication Strategies with Disparities Between Sign Fluency and Hearing Impairment by Hannah Gordon

Freedmen in Indian Territory by Kitt …

Analyzing The Evolution Of Science: Topological Cycles And Community Detection In Knowledge Networks, Frances C. Mcconnell

Mathematics, Statistics, and Computer Science Honors Projects

How scientific knowledge grows and organizes itself is a central question in the study of science. This thesis uses tools from topology and network science to detect and characterize knowledge gaps—places in a field’s literature where related concepts do not co-occur. We develop a metric to quantify the degree of interdisciplinarity of each gap, using the community structure of the underlying network as a proxy for subfields. Across a wide range of fields, gaps reliably span multiple subfields and evolve in recognizable temporal patterns, highlighting new insights into how scientific fields are structured and their stage of development.

Detection, Mapping, And Spraying Of Carolina Redroots In Cranberry Bogs Using Ai And Autonomous Drones, Duwon Ham, Bishal Neupane, Thien Ba Nguyen, Thanh Nguyen, Hieu D. Nguyen, Thierry Besancon

STEM Student Research Symposium Posters

Use artificial intelligent and autonomous drones to automatically detect Carolina Redroots in cranberry bogs, create density maps of the weed, and perform spot spraying.

Unique Combinations Of Packing Integer Squares, Keith M. Dreiling, Austin Leanna, William Mooney

SACAD: Scholarly Activities

This research investigates a function, informally named WAK(x), that describes the number of ways to divide an integer square into integer subsquares counting only the list of parts. Previous research has shown values up to 28, though finding these values is computationally complex and requires a long runtime using computer algorithms. We attempt to find patterns in the values and many aspects of the values, hoping to find a general solution. We are unsure if a solution exists, but we have ideas for how to move forward in finding a solution.

Algorithm Performance In The Search For Hamiltonian Cycles, Chance Davis

Honors Theses

The Hamiltonian cycle problem is ubiquitous in both computer science and graph theory: Given a connected graph, a solution would either confirm the existence of a cycle which visits each vertex only once or its nonexistence. The importance of this problem, as well as its difficulty, is described in the Clay Mathematics Institute’s Millenium Prize Problems and Karp’s 21 NP-complete problems. Despite its “hardness,” solutions to the Hamiltonian cycle problem are desired in logistics, electronic circuit design, and network routing, among other fields. In this work, we benchmark a promising exhaustive enumeration algorithm on various graphs, including ones derived from …

The Waldo Dataset, Mary E. Koone, Rosie Kallie, Vassilis Athisos, Laurel S. Stvan

Computer Science and Engineering Datasets - Archive

Distinct from the task of predicting the author of a document (authorship attribution), we focus on addressing the issue of how to estimate the similarity between the written language styles of authors. To do so, we present a dataset of metadata derived by asking human annotators, who were presented with three documents, to identify which two were written by the same author and which was written by a different author. The dataset has over 400 such annotations, creating a companion to the Amazon Web Services (AWS) customer review dataset, laying the groundwork for crowdsourcing applications to other natural language processing …

Automating Cardiff Model Data Capture In Emergency Departments: Ambient Nlp Integration With Oracle-Cerner Fhir Systems, Simi Augustine, Marco A. Lopez, Jacquelyn Cheun, Chris Papesh

SMU Data Science Review

Violence and overdose events in Las Vegas occur at rates above the national average, with fewer than half of violent injuries reported to law enforcement [2,7]. The Cardiff Model offers a proven framework for standardized data collection and sharing between hospitals and public safety partners, yet many implementations still rely on manual entry. We propose an ambient triage pipeline integrated with Oracle-Cerner electronic health record systems to listen to nurse–patient dialogue, convert speech to text, extract Cardiff fields, and write standards-based FHIR Bundles for analytics. Using SMART on FHIR standards and Cerner Millennium APIs, the study evaluates whether ambient capture …

Demystifying Hardware Formal Verification For Undergraduate Education: A Risc-V Processor Case Study With Coursework Implementation, Riley A. Peters

Master's Theses

Hardware verification engineers apply formal methods to prove that a digital device always behaves according to its specification. This differs from traditional functional verification, in which engineers establish correctness by repeatedly sending test inputs to the device and comparing the outputs against a reference model. With the growing complexity of integrated circuits, the demand for digital verification engineers with formal methods experience has continued to increase. However, California Polytechnic State University: San Luis Obispo's current curriculum lacks dedicated material to prepare students for these roles.

This thesis seeks to address the lack of formal methods material through two efforts. First, …

On Cartan’S Examples Of Isoparametric Hypersurfaces And Their Focal Submanifolds, Thomas E. Cecil, Patrick J. Ryan

Mathematics and Computer Science Department Faculty Scholarship

This paper is a survey of Cartan’s examples of isoparametric hypersurfaces in spheres and their focal submanifolds that were described in his fundamental work on the subject, which appeared in four papers [2]–[5] published during the period 1938–1940.

Effective Wordle Heuristics, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

While previous researchers have performed an exhaustive search to determine an optimal Wordle strategy, that computation is very time consuming and produced a strategy using words that are unfamiliar to most people. With Wordle solutions being gradually eliminated (with a new puzzle each day and no reuse), an improved strategy could be generated each day, but the computation time makes a daily exhaustive search impractical. This paper shows that simple heuristics allow for fast generation of effective strategies and that little is lost by guessing only words that are possible solution words rather than more obscure words.