Mathematics Commons^™

Optimizing Decision-Making In A Cerebral Palsy Model Using Reinforcement Learning, Richard Ampah

Pitzer Senior Theses

This study presents an original interdisciplinary investigation into how reinforcement learning (RL) can model motor and cognitive defects and potentially improve motor and cognitive functions in individuals with cerebral palsy (CP), a non-progressive neurological disorder that impairs movement and adaptability. Integrating computational neuroscience and machine learning, the research applies policy gradient methods and Markov Decision Processes (MDPs) to simulate adaptive learning in agents with and without CP-related constraints.

The central aim is to compare the cumulative rewards of optimal policies, derived from value iteration, and human-like learning policies using the REINFORCE algorithm, both with and without the Bellman baseline. The …

Knörr Lattices For Elementary Abelian Groups Over Unramified Extensions Of Z_P, Marie Swartz

Graduate Research Theses & Dissertations

In this dissertation, we examine the existence of positive height Knörr RD-lattices for D an elementary abelian p-group and R an unramified extension of the p-adics Zp. Knörr lattices form an important subclass of the absolutely indecomposable lattices and have close connections to modular representation theory’s “local to global” behavior. We generalize many prior results, shown only when p = 2, to odd p when |D| = p3. Further, when p = 3, we show that a positive height Knörr RD lattice must have a projective summand when restricted to any maximal subgroup of D. The proof of this requires …

Geometric Function Theory On Uniformly Quasiconformally Homogeneous Domains, Allyson Mackenzie Hahn

Graduate Research Theses & Dissertations

"

Uniformly quasiconformally homogeneous domains in $\mathbb{R}^n$ carry a transitive collection of $K$-quasiconformal maps for a fixed $K\geq 1.$ In this dissertation we investigate three questions in this setting. The first is to show that quasiconformality and quasisymmetry with respect to the quasihyperbolic metric are equivalent. The second is to study normal quasiregular maps from such a domain into $S^n$ or $\mathbb{R}^n$ and determine they hold geometric properties such as a uniform Hölder condition. The third is to study preimages of a power-type mapping and show they are well-distributed in a precise sense.

Efficient Algorithms For Nearest Correlation Matrix Computation With Missing Data, Ibrahim Eniola Oyeyinka

Graduate Research Theses & Dissertations

This thesis investigates efficient algorithms for computing the Nearest Correlation Matrix (NCM) under incomplete financial data. Correlation matrices are vital in portfolio optimization and risk management, yet empirical estimates often violate symmetry, positive semidefiniteness, and unit diagonal conditions due to missing observations. Two projection-based methods are analyzed: the Modified Alternating Projections (MAP) and Anderson Acceleration (AA). Theoretical analysis using convex optimization and normal cone characterization supports numerical evaluation on synthetic and real-world stock-return matrices (550×550, 2020–2025). Missing data are modeled through Missing Completely at Random (MCAR) and Not Missing at Random (NMAR) mechanisms. The results show that AA converges faster …

Bytes, Banter, And The Bible: An Interdisciplinary Account Of Objective Meaning, Cameron Bonin

Senior Honors Theses

The claim that the Bible has objective meaning is contested in a postmodern world. This claim can be more persuasively defended when it is addressed by insights from multiple disciplines. In particular, the field of computer science is apt to illuminate the concept of meaning through its reflection on the nature of languages and its concern with the accurate transmission of information. By synthesizing insights from the field of computer science, such as that of Claude Shannon, with Nicholas Wolterstorff’s use of speech-act theory, the concept of meaning can be understood more clearly. Consequently, this synthesis assists in answering questions …

Estimating The Gender Wage Gap: A Comparative Analysis Of Different Estimators, Xinran Zhang

Mathematics, Statistics, and Computer Science Honors Projects

The gender wage gap between males and females has been well studied by labor economists. We take a multi-prong approach to evaluate three estimators —a regression-imputation estimator, a weighting estimator, and a doubly robust estimator—in estimating the gender wage gap. Using the Panel Study of Income Dynamics, we conduct an empirical study of the estimators’ performances. In a simulation study, we evaluate the properties of estimators and study whether bootstrapping is an appropriate measure of the uncertainty of each estimator. The findings show that while the estimators provide different results, the doubly robust estimator provides reliable and consistent results under …

The Local Deep Galerkin Method Applied To The (2+1)-D Cahn-Hilliard Equation, Caden Fischer

Schultz-Werth Award Papers

Physics-informed Neural Networks (PINNs) are an alternative approach to solving Partial Differential Equations. This study examines the Local Deep Galerkin Method (LDGM), and its application to the (2+1)-Dimensional Cahn-Hilliard Equation (2D-CH). The 2D-CH models phase separation. One application of this is to modeling biofilm. The LDGM is trained on a loss function that minimizes the sum of the squares of the residuals of the system of equations. The LDGM is compared to a numerical simulation based on the Finite Element Method. The results of this study show that LDGM does not produce accurate results for the 2D-CH equation for large …

Securing Secrets: Exploring The Aes Encryption And Key Security Capabilities Of Chatgpt, Kayla Taylor

Student Works

The development and increasing accessibility of generative artificial intelligence (AI) tools and large language models (LLMs) have allowed cryptographers to explore a variety of cryptanalysis problems in dynamic and interactive ways. Prompt engineering, the process by which input text is tested and refined to elicit a desired response from LLMs, is a nascent area of research that remains largely unexplored in many contexts, including cryptography. This study will explore the potential applications and limitations of prompt engineering in the context of Advanced Encryption Standard (AES) encryption and key security with OpenAI’s ChatGPT (GPT-4o) through two main objectives: First, given a …

Permutations Minimizing The Number Of Collinear Triples, Joshua Cooper, Jack Hyatt

Faculty Publications

We characterize the permutations of Fq whose graph minimizes the number of collinear triples and describe the lexicographically-least one, confirming a conjecture of Cooper-Solymosi. This question is connected to Dudeney’s No-3-in-a-Line problem, the Heilbronn triangle problem, and the structure of finite plane Kakeya sets. We discuss a connection with complete sets of mutually orthogonal latin squares and state a few open problems primarily about general finite affine planes.

Geometric Dimensionality Reduction, Daniel Livschitz

CGU Theses & Dissertations

The emergence of AI models developed through computationally intensive training has resulted in a surge of research into dimensionality reduction techniques that spans across numerous mathematical disciplines. In this thesis we establish Geometric Dimensionality Reduction, a non-linear data compression technique that utilizes low dimensional manifolds embedded in dimensional spaces to form composite contraction-and-projection maps. Geometric Dimensionality Reduction is predominantly demonstrated through a novel algorithm entitled LGE (Livschitz-Gu-Eyunni) that utilizes Multicomplex rotation groups and polyspherical coordinates to define a single tuneable logarithmic map from ℝ 2푛 to ℝ 푛+1 with deterministic time complexity, geometric tunability, and semi-reversibility. Significant breakthroughs in the …

A Computational Approach To The Game Of Cycles, Jocelyn Garcia, Mike Janssen, Eliza Kautz

Faculty Work Comprehensive List

In Mathematics for Human Flourishing, Francis E. Su introduced The Game of Cycles, a game played on a finite simple planar graph. In game play, opponents alternate adding direction to the edges of the graph with the goal of creating a cycle or making the last legal move. Recent work has sought to determine winning strategies on certain classes of graphs. We introduce a tabular representation of a game state and provide a computer program that determines which player has a winning strategy on any legal game board. The program builds a directed graph of all possible game states, utilizing …

Studies On Convexity Of Dnf Formulae, Josue A. Ruiz

Electronic Theses & Dissertations (2024 - present)

In this dissertation, we investigate the problem of determining whether a Boolean formula given in disjunctive normal form (DNF) is convex. Although Boolean formulas have various applications, our research focuses on the practical application for rule-based access control policies, where policies are often expressed as a set of Boolean rules. Understanding the structural properties of such formulas is crucial for determining whether a policy can be efficiently represented within a specific access control model.

The main contribution of this research is the conception and analysis of convexity derived from the “gap problem.” In this context, convexity is characterized by the …

Betti Numbers Of Generic Ideals, Jason R. Howell

Electronic Theses & Dissertations (2024 - present)

We present results related to Betti numbers of so called generic ideals over a polynomial ring $T = \Bbbk[x_1, \ldots, x_n]$. For each $m$ define $T(m) = T/(x_{m+1}, \ldots, x_n)$ and for a homogeneous ideal $J$ we use the notation $J(m) = JT(m)$. Also we set $Q(m) = T(m)/J(m)$, and $L(m) = ann_{Q(m)}(x_m)$. The first main result is Theorem \ref{Long Exact Sequence} where we produce the following long exact sequence \begin{align*} \cdots \rightarrow &Tor_{k+1,j}^{T(m-1)}(Q(m-1),\Bbbk) \rightarrow Tor_{k-1,j+1}^{T(m-1)}(L(m),\Bbbk)_{j-1} \rightarrow Tor_{k,j}^{T(m)}(Q(m),\Bbbk) \rightarrow \\ &Tor_{k,j}^{T(m-1)}(Q(m-1),\Bbbk) \rightarrow Tor_{k-2,j-1}^{T(m-1)}(L(m),\Bbbk) \rightarrow \cdots. \end{align*} The second main result is Theorem \ref{Theorem F(j,m) equiv k(j,m)} where we explicitly describe …

Comparison Of Methane Emission Quantification Methods At Landfills In New York State, Alexandra M. Catena

Electronic Theses & Dissertations (2024 - present)

Greenhouse gas (GHG) emission increases are a consequence of global population rise and economic growth. It is well known that carbon dioxide is the dominant GHG by mass, but methane has received increasing attention recently due to its high warming potential and relatively short lifetime of about a decade. Methane has several different types of both natural and anthropogenic sources including wetlands, waste management, energy, agriculture and farming, and wildfires, which makes tracking and reducing methane emissions a complex problem. The emission rates of each of these sources are highly uncertain due to differing emission estimation methods, which can be …

Weakly Reversible Deficiency Zero Realizations Of Polynomial Dynamical Systems, Neal Ryan Buxton

Graduate Theses, Dissertations, and Problem Reports (ETD)

Weakly reversible, deficiency zero (WR0) systems form a large class of polynomial ODEs modeling chemical reaction networks. Their behavior is exceptionally stable: they have unique positive steady states, which are locally asymptotically stable (they are also conjectured to be globally asymptotically stable). This powerful result (the Deficiency Zero Theorem) applies to a large class of high dimensional, nonlinear polynomial dynamics, and is independent of the choice of parameters in the model. In this dissertation we present two algorithms that expands the scope of the Deficiency Zero Theorem to:

1. Networks with WR0 realizations, i.e. networks that are not necessarily WR0 …

Orientable Quadrilateral Embeddings Of Cartesian Products Of Graphs, Matthew Farnsworth, Max Goskie, Adrian Volpe, Jackson Sayre

SPARK Symposium Presentations

In the spirit of Pisanski (1989) we consider orientable quadrilateral embeddings of Cartesian products of cycles on surfaces. We offer a constructive example of such an embedding of three low-order cycles. Then we show more generally that such embeddings exist for the product of a 2-cycle, and even cycle, and an arbitrary third cycle. We represent our graphs using rotation schemes to show this existence. Use of rotation schemes led to the ultimate characterization of our findings visually, providing conjectures for generalizations of products of three cycles.

Σ-Ary, Minnesota State University Moorhead, Mathematics Department

Math Department Newsletters

No abstract provided.

Spectral Theory And The Gelfand Transform, Brenden Schlader

All Graduate Theses, Dissertations, and Other Capstone Projects

The overall goal of this thesis is to study spectral and Gelfand theory as it relates to unital Banach and C∗-algebras. In the first part, we develop the necessary algebraic, analytic, and topological background relevant to the content of this work. We also discuss concrete examples of algebras frequently used in the subsequent sections. In the second part of this thesis, we develop spectral theory by first defining the spectrum of an algebra through the characterization of the invertible and noninvertible elements. In particular, we establish properties of the commutative unital Banach algebra ℓ1(Z). We also establish fundamental results such …

Integrating Sentiment Analysis In Predictive Models: A Comparative Study On Game Popularity On Steam, Khaleefa Alhemeiri

CMC Senior Theses

Over the past decades, the gaming industry has managed to evolve into a multi-billion-dollar enterprise. Gaming platforms such as Steam foster unprecedented amounts of engagement among players worldwide daily. In this thesis, we investigate the effect of incorporating sentiment-driven metrics, specifically YouTube view counts and positive reviews, into predictive models for game popularity. In addition, by comparing our linear regression sentiment-based approach to the Bayesian hierarchical folded normal model used by De Luisa et al. (2021), we can understand the many differences, strengths, and limitations of each methodology. In our thesis, we focus on three games. Each is of varying …

Analyzing Political Sentiment On Micro-Blogging Data: A Lexicon And Machine Learning Approach To The 2024 U.S. Presidential Election, Ava Grey

CMC Senior Theses

This paper explores the trends in sentiment towards U.S. presidential candidates Kamala Harris and Donald Trump through micro-blogging social media text during the five months leading up to the election. Two datasets of varying sizes and origins were used to contextualize and validate analysis findings. The analyses include both a lexicon-based approach and a machine learning predictive method. Common sentiment analysis techniques like term frequency, term frequency inverse, various lexicons, and n-grams were utilized during the lexicon approach. During the modeling, a random forest was utilized in addition to the methods used during the lexicon approach. Results showed that overall …