Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1501 - 1530 of 26863

Full-Text Articles in Mathematics

Algebra Structures For The Koszul Homology Of Minimal Intersections, Kathryn A. Grebel Jan 2025

Algebra Structures For The Koszul Homology Of Minimal Intersections, Kathryn A. Grebel

Mathematics Dissertations - Archive

The Koszul homology of a local ring is a powerful tool in commutative algebra as it provides information on the structure and properties of the ring. In this research, we explore the relationship between quotients of regular local rings and their Koszul homology algebra. One such relationship is detailed by the Tate-Assmus theorem, which asserts, in part, that a ring is a complete intersection if and only if the Koszul homology is generated by its degree 1 homology elements. An objective of this research is to examine and identify the properties of a minimal intersection and its Koszul homology algebra. …


Two Network Flow Problems: Volume Inequalities For Flow Polytopes Of Full Directed Acyclic Graphs; Optimal Additions To The Low-Stress Bike Network In Lexington, Kentucky, James F. Mcelroy Jan 2025

Two Network Flow Problems: Volume Inequalities For Flow Polytopes Of Full Directed Acyclic Graphs; Optimal Additions To The Low-Stress Bike Network In Lexington, Kentucky, James F. Mcelroy

Theses and Dissertations--Mathematics

This dissertation addresses two distinct problems related by their foundation in network flows. The first problem concerns volumes of flow polytopes of directed acyclic graphs with out-degree sequence (3,2,...,2,0). It is proved that there is an interchange operation on the edge set of these graphs that induces a partial order on the graphs isomorphic to a Boolean algebra, and that moving up through this partial order decreases (weakly) the volumes of the corresponding flow polytopes. This result is reinterpreted in the context of linear extensions for posets that are bipartite non-crossing trees.

The second problem develops a discrete optimization model …


Novel Generative And Language Model Architectures With Applications, Edison Mucllari Jan 2025

Novel Generative And Language Model Architectures With Applications, Edison Mucllari

Theses and Dissertations--Mathematics

This dissertation investigates novel architectures to address fundamental challenges in machine learning, particularly focusing on transformer models, recurrent neural networks, GAN and continual learning and their applications in natural language processing and computer vision. We propose the Neumann-Cayley Gated Recurrent Unit (NC-GRU), which leverages a Neumann series-based Scaled Cayley transformation to maintain orthogonal weight matrices, effectively mitigating exploding gradients problems while improving long-term memory retention across prediction tasks. We demonstrate the practical applications of NC-GRU by implementing our proposed architecture into an autoencoder to derive neural molecular fingerprints. Building upon these advancements, we turn our attention to the transformer architecture, …


Blow-Ups And Projectivized Toric Vector Bundles, Sara Church Jan 2025

Blow-Ups And Projectivized Toric Vector Bundles, Sara Church

Theses and Dissertations--Mathematics

This dissertation is set in the intersection of toric geometry, tropical geometry, and the theory of vector bundles. We focus on the geometry of projectivized toric vector bundles and their connections to Mori dream spaces, matroid theory, and tropical geometry. We generalize previous results on the quotient construction of Gonzalez, Hering, Payne, and Suss (GHPS) by introducing a new approach to describing the geometry of these bundles via associated blow-ups. Additionally, we examine tautological bundles arising from representable matroids and establish connections between their geometry and the wonderful compactification. Finally, we consider the case where Klyachko filtrations have maximal steps …


The Computational Algebra Of Conformal Blocks, Casey B. Hill Jan 2025

The Computational Algebra Of Conformal Blocks, Casey B. Hill

Theses and Dissertations--Mathematics

Conformal blocks are objects in quantum field theory that arise from conformal trans- formations, which are symmetries that preserve angles but not length. This aspect of conformal field theory has various interactions with algebraic geometry.

In this dissertation, we explore the underlying algebra and geometry of spaces and algebras of conformal blocks over SLn. We then use this information along with techniques from combinatorial commutative algebra, algebraic geometry, and representation theory to find a presentation of the algebra of SL4-conformal blocks. With this presentation, we then use computational methods to learn about some of the geometric properties of this algebra.


Quantized Average Agreement Algorithms With Error Correction For Digraphs, Shuaib A. Mughal Jan 2025

Quantized Average Agreement Algorithms With Error Correction For Digraphs, Shuaib A. Mughal

Honors Undergraduate Theses

Multi-agent systems have become more and more prevalent as technology increasingly gets integrated into our daily lives. Some of these technological systems are large in size; for example, the smart grid where multiple devices are used to monitor and control different aspects of the energy grid. Another example is a team of autonomous systems deployed for a specific task. When these systems are spatially distributed, an important component of distributed algorithms is the ability for the agents to reach consensus on the global state of the system. Reaching agreement enables the spatially distributed agent make decisions or determine the next …


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

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 …


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

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 …


Measuring The Similarity Between Trees Of Different Order, Camilo Morales Jan 2025

Measuring The Similarity Between Trees Of Different Order, Camilo Morales

HMC Senior Theses

Graphs encode relationships between data. However, due to their versatility, it is often difficult to generalize the notion of similarity between two graphs using a distance function. Since graphs can represent various data sets, specific distance metrics need to be tailored for questions we are interested in answering or the data set we are working with. This project is motivated by ongoing investigations into the evolution of female gender representation in mathematics. By building off previous work that has taken data from the Mathematics Genealogy Project and modeled this evolution of representation via a tree, we would like to develop …


Enhancement Of Mechanical, Structural, And Electrical Properties In Advanced Composites And Vat Photopolymerized 3d Printing Nanocomposites, Poom Narongdej Jan 2025

Enhancement Of Mechanical, Structural, And Electrical Properties In Advanced Composites And Vat Photopolymerized 3d Printing Nanocomposites, Poom Narongdej

CGU Theses & Dissertations

Advanced composites have gained significant attention across various industries, including aerospace, automotive, clean energy, and healthcare, owing to their exceptional mechanical properties and versatility. Fiber-reinforced polymer (FRP) composites, particularly those reinforced with carbon fibers, are extensively used as structural materials in spacecraft, aircraft, high-performance vehicles, and wind turbines due to their high strength-to-weight ratios, stiffness, durability, and tailorable mechanical characteristics. In healthcare, the advent of additive manufacturing (3D printing) has expanded the utility of advanced composites, enabling precise customization of components to meet patient-specific needs while offering design flexibility and ease of fabrication. Despite these advantages, several challenges hinder the …


Action This Day: The Mathematics And Machinations That Bested The German Enigma, Jonah Weinbaum Jan 2025

Action This Day: The Mathematics And Machinations That Bested The German Enigma, Jonah Weinbaum

Dartmouth College Master’s Theses

This thesis presents a comprehensive and chronological overview of cryptographic techniques designed to break Enigma, beginning in 1932 and culminating in the creation of the Turing-Welchman Bombe. We discuss the mathematical theory and electromechanical implements used to decode one of history's greatest ciphers.

Reexamining the Bombe through the lens of modern group theory, we critique Alan Turing's estimation of the number of "stops" that the Bombe produces for various plaintext-ciphertext pairing structures. To address its limitations, we introduce a new framework for estimating the number of stops by extending John Dixon's theorem concerning the probability that uniformly distributed elements of …


Mathematics And Determinism: Chaos, Quantum Mechanics, And The Limits Of Predictive Structure, Jackson T. Salumbides Jan 2025

Mathematics And Determinism: Chaos, Quantum Mechanics, And The Limits Of Predictive Structure, Jackson T. Salumbides

CMC Senior Theses

This thesis examines the relationship between mathematics and determinism by analyzing how chaos theory, quantum mechanics, and formal mathematical limits challenge traditional conceptions of predictability and causal structure. Chaos theory shows that deterministic systems can exhibit practical unpredictability due to sensitivity to initial conditions. Quantum mechanics introduces probabilistic outcomes that complicate deterministic interpretation, though alternative frameworks such as Bohmian mechanics and superdeterminism attempt to restore determinism at conceptual cost. Additionally, results from mathematical logic, including Gödel’s incompleteness theorems and Turing’s undecidability, demonstrate intrinsic limitations on what can be deduced or computed, even in fully deterministic systems. By synthesizing these areas, …


Machine Learning Methods For Intrusion Detection And Response In Network Security, Ayomide Oyemaja Jan 2025

Machine Learning Methods For Intrusion Detection And Response In Network Security, Ayomide Oyemaja

College of Graduate Studies: Theses & Dissertations

Intrusion Detection Systems (IDS) play a crucial role in computer network security by identifying malicious activities and potential cyberattacks. This thesis combines machine learning and cybersecurity by applying Reinforcement Learning (RL) in intrusion detection and response using the NSL-KDD dataset.

We designed and implemented a Q-learning framework where an agent learns to classify network traffic over time by interacting with the environment and receiving rewards based on detection accuracy. We also look at the importance of feature selection and classification techniques and how effective they are in improving model performance, reducing the complexity of computation, and producing more desirable results. …


Analyzing Patterns In Chicago Motor Vehicle Crashes Using Time-Series Techniques, Christina Trotta Jan 2025

Analyzing Patterns In Chicago Motor Vehicle Crashes Using Time-Series Techniques, Christina Trotta

Senior Honors Theses and Projects

This project explores time series forecasting of daily traffic crash rates in Chicago from 2018 to 2024, with a focus on understanding how past crash patterns and external conditions influence future risk. The primary research question asks: To what extent does yesterday’s crash rate help predict today’s? Using a combination of Holt-Winters exponential smoothing, Prophet forecasting, and SARIMAX models, we assess the role of autoregression, seasonality, and exogenous variables such as weather and roadway conditions. Daily crash data was cleaned, aggregated, and enriched with engineered features including holiday indicators, weather metrics from O’Hare and Midway airports, and binary flags for …


Sickle-Cell Genotyping Cost Analysis In Amua And R, Nicholas P. Haley Jan 2025

Sickle-Cell Genotyping Cost Analysis In Amua And R, Nicholas P. Haley

Senior Honors Theses and Projects

Sickle cell disease (SCD) is a prevalent genetic disorder in the United States, with a significant economic burden due to the high costs of care, especially from chronic red blood cell (RBC) transfusions. These transfusions carry risks such as alloimmunization, which can lead to complications like delayed hemolytic transfusion reactions (DHTRs), further increasing healthcare costs in addition to increasing suGering. This study aims to aid in the evaluation of cost-eGective strategies for SCD management using Markov models, currently within TreeAge Pro software, which is proprietary. A decision model was adapted from the Kacker et al. (2013) study, which analyzed the …


Fairness-Aware And Culturally Adaptive Machine Learning For Predicting Adolescent Substance Use, Stephanie Nworgu Jan 2025

Fairness-Aware And Culturally Adaptive Machine Learning For Predicting Adolescent Substance Use, Stephanie Nworgu

Senior Honors Theses and Projects

Early initiation of substance use during adolescence poses significant risks to long-term health, educational attainment, and social outcomes, making early identification a critical public health priority. Machine learning models have increasingly been used to predict substance use risk; however, many such models do not explicitly examine whether predictive performance differs across demographic groups. This senior project examines the fairness of logistic regression models used to predict first-time alcohol use among adolescents. Using nationally representative survey data from the Youth Risk Behavior Surveillance System (YRBSS), pooled across the 2017, 2019, 2021, and 2023 survey cycles, this study develops logistic regression–based predictive …


On Linear Invariants Of Hypergraphs, Clara Chaplin Jan 2025

On Linear Invariants Of Hypergraphs, Clara Chaplin

Honors Theses

We introduce linear invariants of hypergraphs as a way to study hypergraphs by their tensor representations. Our primary research goal is to determine what information linear invariants capture about the hypergraphs they arise from. We first investigate the centroid, which is shown to determine the connected components of a hypergraph. Next, we study the derivations of a hypergraph, and use this linear invariant to define a quotient operator $Q_\mathrm{Der}$ on the collection of all hypergraphs. This operator is shown to be a closure operator in that $Q_\mathrm{Der}(Q_\mathrm{Der}(\mathcal{H}))=Q_\mathrm{Der}(\mathcal{H})$ for any hypergraph $\mathcal{H}$. We apply the operator $Q_\mathrm{Der}$ to synthetically generated hypergraphs, …


Developing Mathematical Maturity By Solving A Given Quadratic Equation, Armando A. Amador, Nieves Angulo, Juan B. Lacay Jan 2025

Developing Mathematical Maturity By Solving A Given Quadratic Equation, Armando A. Amador, Nieves Angulo, Juan B. Lacay

Publications and Research

This article explores the instructional challenges faced by mathematics educators when addressing students’ limited background knowledge and underdeveloped mathematical maturity, two critical barriers to success in college-level algebra. Using the quadratic equation 2x2+x−3=0, which is reducible over the field of rational numbers ℚ ⊂ ℝ, we analyze how diverse solution methods—factoring, completing the square, and the quadratic formula—can support learning. An additional strategy, “Slide and Divide,” was introduced to promote procedural fluency and conceptual flexibility. To gain insight into students’ evolving mathematical maturity, an online survey was conducted to students at various levels of mathematics. The survey captured their perspectives …


Partial Group Divisible 3-Designs, Apiwat Peereeyaphat Jan 2025

Partial Group Divisible 3-Designs, Apiwat Peereeyaphat

Chulalongkorn University Theses and Dissertations (Chula ETD)

We introduce a generalization of group divisible 3-designs, 3-GDDs, with two groups and two indices. A partial group divisible 3-design, 3-PGDD(gı + g2, k; A, (21, 112), is an ordered pair (GrU G2, B) where G, and G2 are disjoint finite sets called groups) of size g1 and 92, respectively; and B is a collection of k-subsets (called blocks) of G, UG, such that every 3-subset of G; occurs in exactly 1 blocks in B, and every i elements of G and j elements of G2 occur together in exactly Mig blocks in B for i. i € (1,2} and …


Schaper Numbers, Palindrome Partitions, And Symmetric Functions, With Applications To Characters Of The Symmetric Group, Karlee J. Westrem Jan 2025

Schaper Numbers, Palindrome Partitions, And Symmetric Functions, With Applications To Characters Of The Symmetric Group, Karlee J. Westrem

Dissertations, Master's Theses and Master's Reports

Finding the decomposition numbers for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information about the decomposition numbers. In Chapter 2, we give a combinatorial formula for the Schaper number when the partition has at most two columns. At the end, we provide a conjecture for the Schaper number for the partition of shaper (3^n).

Chapter 3 covers the joint work with my advisor, David Hemmer, and …


The Combinatorics Of Integer Partitions Enumerated By Some Exotic Weights, Hunter Waldron Jan 2025

The Combinatorics Of Integer Partitions Enumerated By Some Exotic Weights, Hunter Waldron

Dissertations, Master's Theses and Master's Reports

Identities of integer partitions generally state that two dissimilar appearing families of partitions are in fact equinumerous when both are restricted to any fixed size. Euler's theorem is a classic example of such an identity, which equates the number of partitions with odd parts to the number of partitions with distinct parts. Lately, analogs of known partition identities involving weights other than size have begun to attract research interest. This dissertation is an investigation of two such weights. In Chapter 2, we study Schmidt weights, which count only parts with indices belonging to some given subset of the positive integers. …


Runner Locating With Multiple Probes, Kola Akinrele, Axel Brandt, Elizabeth Breen, Catherine Erbes, Matthew Lee, Patrick O’Doherty, Weston Rainer Jan 2025

Runner Locating With Multiple Probes, Kola Akinrele, Axel Brandt, Elizabeth Breen, Catherine Erbes, Matthew Lee, Patrick O’Doherty, Weston Rainer

2025 Faculty Bibliography

In the runner locating variation of cops and robbers on a graph, a chaser attempts to locate an invisible runner by probing a single vertex v each turn, from which the chaser learns the runner’s distance. The runner is then permitted to stay at his current vertex or move to an adjacent vertex other than v. A graph is locatable if the chaser is able to locate the runner in a finite number of turns, and the location number of a graph is the minimum number of turns necessary to determine the runner’s location regardless of the runner’s evasion strategy. …


Optimal Control And Structurally-Informed Gradient Optimization Of A Custom 4-Dof Rigid-Body, Brock Marcinczyk, Logan E. Beaver Jan 2025

Optimal Control And Structurally-Informed Gradient Optimization Of A Custom 4-Dof Rigid-Body, Brock Marcinczyk, Logan E. Beaver

Mechanical & Aerospace Engineering Faculty Publications

This work develops a control-centric framework for a custom 4-DOF rigid-body manipulator by coupling a reduced-order Pontryagin’s Maximum Principle (PMP) controller with a physics-informed Gradient Descent stage. The reduced PMP model provides a closed-form optimal control law for the joint accelerations, while the Gradient Descent module determines the corresponding time horizons by minimizing a cost functional built directly from the full Rigid-Body Dynamics. Structural-mechanics reaction analysis is used only to initialize feasible joint velocities—most critically the azimuthal component—ensuring that the optimizer begins in a physically admissible region. The resulting kinematic trajectories and dynamically consistent time horizons are then supplied to …


Vanishing Of Local Cohomology With Applications To Hodge Theory, Scott Hiatt Jan 2025

Vanishing Of Local Cohomology With Applications To Hodge Theory, Scott Hiatt

Mathematics Faculty Publications

Let H = ((H, F •), L) be a polarized variation of Hodge structure on a smooth quasi-projective variety U . By M. Saito’s theory of mixed Hodge modules, the variation of Hodge structure H can be viewed as a polarized Hodge module M ∈ HM (U ). Let X be a compactification of U , and j : U ↪→ X is the natural map. In this paper, we use local cohomology with mixed Hodge module theory to study j+M ∈ DbM HM (X). In particular, we study the graded pieces of the de Rham complex GrF p DR(j+M) …


Moore Graphs, Trevor Saxton Jan 2025

Moore Graphs, Trevor Saxton

Williams Honors College, Honors Research Projects

A Moore graph is a simple regular graph, with n vertices, degree d, and diameter k, that satisfies the Moore bound: n = 1 + d (d − 1)k − 1 d − 2 . There are graphs for which the bound is met and in which existence and uniqueness are known. For k = 2 it is known that the Moore bound is achieved for d = 2, 3, 7, with the case of d = 57 conjectured to exist. For k = 3 the bound is achieved for only d = 3 [5]. Due to the construction of …


Spectral Theory And The Gelfand Transform, Brenden Schlader Jan 2025

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 …


A Bibliographic And Topic Modeling Analysis Of The P-Adic Theory Literature Using Latent Dirichlet Allocation, Humberto Llinás, Ismael Gutiérrez, Anselmo Torresblanca, Javier De La Hoz, Brian Llinás Jan 2025

A Bibliographic And Topic Modeling Analysis Of The P-Adic Theory Literature Using Latent Dirichlet Allocation, Humberto Llinás, Ismael Gutiérrez, Anselmo Torresblanca, Javier De La Hoz, Brian Llinás

Computer Science Faculty Publications

P-adic analysis, introduced by Kurt Hensel in the early 20th century, has developed into a fundamental area of mathematical research with broad applications in number theory, algebraic geometry, and mathematical physics. This study aims to examine the thematic evolution and scholarly impact of p-adic research through a comprehensive topic modeling and bibliometric analysis. Using classical bibliometric techniques (e.g., performance analysis, co-authorship, and co-citation networks) combined with Latent Dirichlet Allocation (LDA), we analyzed 7388 peer-reviewed documents published between 1965 and 2024. The computational workflow was conducted using R (version 4.4.1) and VOSviewer (version 1.6.20), which enabled the identification of 20 distinct …


Analyzing Car Theft Trends In Central Texas: A Comparative Study Of Waco, College Station, And Killeen, Daniel Njogu Jan 2025

Analyzing Car Theft Trends In Central Texas: A Comparative Study Of Waco, College Station, And Killeen, Daniel Njogu

Williams Honors College, Honors Research Projects

This study examines motor vehicle theft (MVT) trends from 2019 to 2023 in three Central Texas cities—Waco, College Station, and Killeen—using temporal analysis, geospatial hotspot mapping, and make/model data. In Killeen, thefts generally rose over the period, with notable peaks in October and on Mondays. College Station saw an overall decline in thefts but experienced a seasonal spike each March, and Waco’s thefts increased until around 2021 before beginning to fall. Local festivals—such as the Spirit of Texas in College Station and the Heart O’ Texas Fair in Waco—appear to coincide with these seasonal upticks. Hyundais and Kias were most …


A Geometric Characterization Of N-Graded Manifolds And The Frobenius Theorem, Henrique Bursztyn, Miquel Cueca, Rajan Amit Mehta Jan 2025

A Geometric Characterization Of N-Graded Manifolds And The Frobenius Theorem, Henrique Bursztyn, Miquel Cueca, Rajan Amit Mehta

Mathematics Sciences: Faculty Publications

This paper studies graded manifolds with local coordinates concentrated in non-negative degrees. We provide a canonical description of these objects in terms of classical geometric data and, building on this geometric viewpoint, we prove the Frobenius theorem for distributions in this graded setting.


The Inverse Scattering Transform For The Nonlinear Schrödinger Equation, Ivan Casas-Rocha Jan 2025

The Inverse Scattering Transform For The Nonlinear Schrödinger Equation, Ivan Casas-Rocha

Honors Undergraduate Theses

The Nonlinear Schrödinger (NLS) Equation, iψt + 1/2 ψxx ± |ψ|2ψ = 0, is a nonlinear partial differential equation which is used to model several physical phenomena including nonlinear effects inside optical fibers and the formation of rogue waves in shallow water. It is particu- larly difficult to study solutions to this equation due to the nonlinearity, and the nonlinearity leads to incredibly interesting solutions not found in linear PDEs such as solitons. In this thesis, we highlight two methods of obtaining solutions to the (NLS) equation: the Inverse Scattering Transform and the Dressing Method. Furthermore, …