Mathematics Commons^™

Quasi-Poisson Analogs Of Regular Poisson Varieties, Casen Thompson

All Graduate Theses and Dissertations, Fall 2023 to Present

Let G be a complex semisimple linear algebraic group with 𝐶 a conjugacy class of parabolic subgroups of G. In previous work, Dr. Crooks defines 𝑢_𝐶→ B_𝐶 , a universal flat family of a fine Hamiltonian Lagrangian G-bundles over 𝐶, and shows that 𝑢_𝐶 is a family of regular Poisson varieties. This manuscript introduces a natural candidate for a quasi-Poisson analog of Dr. Crooks’s construction, 𝑢_𝐶, using the framework of quasi-Poisson geometry established by Alekseev, Kosmann-Scwarzbach, and Meinrenken. It will be shown that this proposed quasi-Poisson analog indeed has a valid quasi-Poisson structure and …

Powers' Conjecture On The Third Largest Eigenvalue Of A Graph, Kevin Schmidt

Master's Theses

In 1989, David Powers conjectured that for any connected graph G on n vertices, the k-th largest eigenvalue of the adjacency matrix satisfies λk(G) ≤ ⌊n/k⌋ for every 1 ≤ k ≤ n/2. The conjecture has since been resolved case by case, in the sharper form λk(G) ≤ n/k − 1: the case k = 1 is classical, k = 2 was settled independently by Hong and by Powers in 1988, and k ≥ 4 was shown to fail by Nikiforov and Linz. This thesis surveys the resolution of the remaining case, k = 3, achieved in March 2026 by …

A Study On Some Distance Based Domination Parameters In Graphs And Their Applications, Shanmugavelan S Mr

Theses and Dissertations

Distance-based domination has emerged as a significant development in graph theory, attributed to its applications in communication systems, interconnection networks, parallel architectures, and chemical graph models. This thesis focuses on two such graph invariants: hop domination number and 2-hop domination number of graphs. The hop domination number of some generalized graph structures like generalized thorn paths, generalized theta graphs, and snake graph families is studied along with a newly introduced family, namely generalized ciliates.

Moreover, a variant of hop domination number, namely, the 2-hop domination number, is studied for some grid families like ladder, hexagonal grid, and its variants. Furthermore, …

Relationship Between Aleks Use, Implementation Models, And Grade 9 Students’ Achievement On Algebra 1 Summative Assessments, Deneen Alfordburke

Walden Dissertations and Doctoral Studies

The problem that was addressed through this study was Grade 9 students’ achievement on the Algebra 1 New Jersey Student Learning Assessment (NJSLA) continued to be below the proficiency level that is defined by the state, despite implementation of Assessment and Learning in Knowledge Spaces (ALEKS) Algebra 1 software. The study was grounded in Doignon and Falmagne’s knowledge space theory (KST) which evaluates students’ current knowledge levels and guides them along individualized learning paths based on what they are ready to learn next. The purpose of this nonexperimental quantitative study was to determine whether the predictor variables Grade 9 students’ …

Self-Organized Criticality In Biased Activated Random Walk, Joshua Meisel

Dissertations, Theses, and Capstone Projects

We demonstrate many of the conjectured universality and self-organized criticality (SOC) properties of the interacting particle system Activated Random Walk (ARW) in the setting of one-dimensional biased walks, as formulated for instance in Levine and Silvestri’s 2024 survey. Namely, there exists the same limiting critical state for two finite ARW models, as well as for the infinite model as the density approaches its critical value from below. Many of the desired properties hold, including heavy-tailed avalanches, but spatial correlations decay exponentially fast, a deviation from the SOC paradigm. Nonetheless, the obtained decay rate vanishes with the bias. Since the critical …

Quaternionic Analogues Of Zagier’S Sums Of Binary Quadratic Forms, Ajmain A. Yamin

Dissertations, Theses, and Capstone Projects

Let K be the real numbers R, complex numbers C or quaternions H. Let O ⊂ K be a full rank discrete Euclidean subring of K. We investigate certain functions F_{k,Δ,O} : K → R indexed by positive integers k, Δ with k odd. When K = R or C, these functions recover Zagier’s sums of binary quadratic forms and Karabulut’s sums of binary Hermitian forms respectively. When K = H, the F_{k,Δ,O} functions are new quaternionic analogues of Zagier's sums whose definition involves sums of binary Hamiltonian forms as defined by Parkkonen-Paulin.

We prove that for fixed "weight" k …

Model-Theoretic Arguments In Philosophy, Peter Susanszky

Dissertations, Theses, and Capstone Projects

This dissertation is on model-theoretic arguments in philosophy, especially those of Quine, Davidson, and Putnam. In the first part, to ground the debate, I give a rigorous introduction to the salient parts of first-order model theory. I start the second part by giving an introduction to Quine's philosophy, and how the model-theoretic arguments fit into it. After considering how Donald Davidson adopted the Quinean lesson, I move on to Putnam's model-theoretic arguments. Putnam's spin on these model-theoretic considerations significantly departs from Quine and Davidson, while retaining many of the core ideas. Most importantly, I argue that the target of Putnam's …

Set-Valued Conjugate Calculus And Duality In Optimization And Machine Learning Via Generalized Relative Interiors, Gary Lee Sandine

Dissertations and Theses

Convex analysis, optimization, and duality theory are broadly applicable to a multitude of real-world problems. Theoretical frameworks ensuring strong duality and optimality are fundamentally tied to convex separation under qualification conditions frequently involving topological or relative interiors. These can be empty in convex sets that appear naturally in infinite-dimensional models, yet guarantees of optimality and strong duality are often attainable. This dissertation presents frameworks for applying convex separation via generalized relative interiors to develop generalized calculus rules as well as conditions for strong duality and optimality for infinite-dimensional constrained convex optimization problems.

The first major contribution is the introduction of …

Algebraic And Topological Methods In Computational Neuroscience, Trong-Thuc Trang

Electronic Theses and Dissertations 2020 - Present

Neural data is incredibly rich in combinatorial, topological, and geometrical information, reflecting the intricate shape and connectivity of neural firing patterns. To decipher these structures, neuroscience increasingly relies on advanced mathematical tools to analyze neural activity. Here we study (1) neural codes within the poset P_Code of neural codes and (2) the connectivity of neural population activity within the insular cortex when responding to interoceptive information. In (1), we establish combinatorial constructions for all upward covering relations based on what we call “isolated subsets” with supporting theorems and give a slight modification of the existing downward covering relations. We …

Applications Of Machine Learning To Gas Plume Analysis In Longwave Infrared Hyperspectral Images, Scout C. Jarman

All Graduate Theses and Dissertations, Fall 2023 to Present

Each pixel from a hyperspectral camera measures the intensity of light over a continuous range of wavelengths, which is in contrast to traditional color cameras, which just measure the intensity of red, green, and blue wavelengths of light. Longwave infrared hyperspectral images can be used to detect gases from a distance by measuring how different materials emit and absorb heat. This makes them useful for applications such as monitoring industrial emissions or locating hazardous gas leaks. In practice, however, gas signatures in these hyperspectral images are often weak and easily obscured by variations in the background scene, making reliable identification …

Spatial Prediction Under Uncertainty: Methodological And Computational Advances In Bayesian Maximum Entropy, Kinspride K. Duah

All Graduate Theses and Dissertations, Fall 2023 to Present

Environmental decisions such as infrastructure design, water management, and snow load estimation depend on spatial data that are often incomplete or uncertain. In many cases, measurements are not exact values but ranges, reflecting limitations in data collection methods. Traditional mapping techniques typically simplify these uncertain measurements, which can lead to less accurate predictions. This dissertation introduces improved statistical tools for making spatial predictions when data are uncertain or partially known. By utilizing a framework called Bayesian Maximum Entropy (BME), this research demonstrates how exact measurements and range-based data can be combined in a mathematically consistent way. The work demonstrates that …

Learning Latent Structure In High-Dimensional Data Via Geometry And Graphs, Haozhe Chen

All Graduate Theses and Dissertations, Fall 2023 to Present

Modern datasets often contain many measured variables for each observation, such as gene-expression levels, brain activity signals, or features in tabular data. These data are also often noisy, meaning that useful patterns are mixed with measurement error or irrelevant variation. Although such datasets can appear complex, they are frequently represented by simpler hidden structures, such as trajectories, clusters, or relationships between observations. This dissertation develops methods for uncovering these hidden structures by learning geometric and graph-based representations directly from data. The first part introduces Functional Information Geometry, which represents local patterns in high-dimensional data using functional features and constructs a …

Ramsey Chains In Graphs, Ritabrato Chatterjee

Dissertations

The research in this work deals with decomposition of graphs and Ramsey theory, two popular areas of research in graph theory due to numerous fascinating problems and the sheer mathematical beauty of the subjects. A decomposition {G₁, G₂, ..., G_k} of a graph G into subgraphs of G is ascending if the subgraph G_i is isomorphic to a proper subgraph of G_i+1 for i = 1, 2, ..., k − 1. The well-known and long-standing of Ascending Subgraph Decomposition Conjecture states that every graph has an ascending subgraph …

Unifying And Expanding Global And Local Variable Importance Methods For Explainable Machine Learning, Kelvyn K. Bladen

All Graduate Theses and Dissertations, Fall 2023 to Present

Machine learning methods are powerful analytical tools used across all scientific disciplines and many other fields of investigation for prediction and inference from diverse data sources. Despite their broad applicability, machine learning methods are often highly complex and difficult to interpret. Developing a greater understanding of which variables most influence a response is essential for increasing the interpretability of these models and supporting informed decision-making. This research focuses on improving how we evaluate the importance of these variables.

One common approach is to shuffle the values of a variable and see how much the model accuracy gets worse. Another approach …

Mapler: An R Package For Estimating The Impact Of Climate Change On Maple Syrup Production, Matthew T. White

All Graduate Theses and Dissertations, Fall 2023 to Present

Successful maple sap tapping depends on the freeze/thaw cycle (i.e., temperatures fluctuating above/below freezing) during the winter and spring. Climate change threatens to alter the timing and duration of the tapping season. This necessitates research into how maple sap tapping will be impacted by climate change in order to help maple syrup producers prepare for the future. We define a sap day as a day where the freeze/thaw cycle occurred. Using information climate scientists use to predict future temperatures, we calculate how many sap days could occur each year. We develop software to analyze these sap day calculations to determine …

Advantages Of Dynamic Representation For Related Rates Problems In Calculus, Eri Osuna

Electronic Theses, Projects, and Dissertations

Related-rates problems are a standard yet persistently difficult topic in first-semester calculus. Research increasingly recommends dynamic visualization tools such as GeoGebra, but direct comparisons of static and dynamic representations in related-rates settings remain scarce. This qualitative study examines how representation type shapes the quality of students' reasoning and their perceived experience during related-rates problem solving. Six mathematics students who had completed Calculus —a group of four undergraduates and a pair of graduate students—completed a static sliding-ladder task and a dynamic airplane-and-camera task supported by an interactive GeoGebra applet, followed by an interview. Findings indicate that the two representations supported reasoning …

Geodesic Completeness And The Hopf-Rinow Theorem, Christopher Farias

Electronic Theses, Projects, and Dissertations

Differential geometry is concerned with the properties of calculus and geometry on curved n-dimensional manifolds. As a result, thinking about such a space often runs counter to the Euclidean geometer's intuition of distances, angles, and transformations. This thesis aims to build up to proving an important result in the study of Riemannian manifolds: the Hopf-Rinow theorem.

In Chapter 2, we begin by defining what a manifold is and showing that the collection of directional derivatives at a point on the manifold spans a tangent vector space. After defining a basis and a metric for this space, in Chapter 3, we …

Comparing 3-Connectedness And Roundness In Matroid Theory, Blanca Delia Larios

Electronic Theses, Projects, and Dissertations

A matroid is a discrete mathematical object that abstracts and connects the various notions of independence found throughout mathematics. Such notions of independence include linear independence, algebraic independence, as well as notions of independence that arise in graph theory. There are many broad classes of matroids. Important examples include binary matroids, graphic matroids, regular matroids, uniform matroids, and various levels of connected matroids. Some of the most important problems in matroid theory involve characterizing classes of matroids so that such characterizations can be used to prove results concerning these matroid classes. This thesis is a study of two important classes …

Student Attitudes And Perceptions Of Proof In Mathematics, Emelin G. Sibrian Marquez

Electronic Theses, Projects, and Dissertations

Traditionally, mathematical proof is viewed primarily as a tool for validation or verification. However, proof holds many other important roles such as discovery, reasoning, explanation, and justification. For many students, these other roles are not always obvious. Those encountering rigorous proof for the first time often find the process abstract, intimidating or disconnected from their previous learning. This disconnect can lead to negative attitudes as students transition from computational mathematics to advanced proof-based mathematics. Utilizing a mixed-methods approach, this study examined undergraduate and graduate mathematics students at a Hispanic-Serving Institution (HSI) in Southern California. We investigated what students perceive the …

Stabilized Continuous Galerkin Methods For Heat Transport In Fully Coupled Nonlinear Thermo-Poroelasticity In Heterogeneous Porous Media, Payel Dey

Open Access Theses & Dissertations

This thesis focuses on the numerical approximation of a coupled Thermo-Hydro-Mechanical (THM) model with advective heat transport in heterogeneous media. The governing equations consist of three coupled equations: the momentum balance, the fluid mass balance, and the energy balance. The primary unknowns are displacement, pressure, and temperature. In this system, the fluid pressure determines the Darcy flux, and this flux transports heat through the advective term in the energy equation. Since the Darcy flux is computed numerically from the flow equation, the conservation properties of the flow approximation can affect the temperature solution. This effect is especially important when thermal …

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 …

Pseudo-Riesz Bases, Deborpita Biswas

All Dissertations

In this dissertation, we will introduce the concept of pseudo-Riesz bases, extending the influential notion of near-Riesz bases first proposed by J. Holub in the 1990s. Our goal is to develop an analogous theory for pseudo-Riesz bases, obtaining results parallel to those known for near-Riesz bases, with suitable modifications.

We will develop the foundational theory of pseudo-Riesz bases. Unlike classical Riesz bases, these sequences need not be complete or independent; however, they still retain meaningful expansion properties. We will investigate the conditions under which a Bessel sequence can be transformed into a Riesz basis through finite modifications. In particular, we …

Convergence Theory For Deep And Multi-Grade Neural Architectures, Lei Huang

Mathematics & Statistics Theses & Dissertations

This dissertation studies two complementary notions of convergence arising in modern neural network models: the convergence of recursively constructed neural network architectures and the convergence of optimization algorithms used for training neural-network-based image restoration models. The first part develops a convergence theory for deep neural networks (DNNs) viewed as recursively generated sequences of functions. Within an Lp framework motivated by statistical learning, sufficient conditions are established under which increasing-depth neural network sequences converge to well-defined limiting functions. The analysis covers both bounded-width and unbounded-width architectures, establishes explicit convergence rates, and motivates a network initialization strategy derived from the convergence conditions. …

Boundary Integral Method For A Modified Mullins–Sekerka System, Ly Le

Mathematics & Statistics ETDs

This thesis develops a boundary integral method for a modified Mullins–Sekerka system arising as the sharp-interface limit of a nonreciprocal Cahn–Hilliard model. Nonreciprocal coupling changes the classical Cahn–Hilliard structure by introducing an additional conserved field, leading to coupled elliptic and parabolic dynamics at the interface. Using matched asymptotic expansions, we formally derive the modified Mullins–Sekerka model and then apply the boundary integral method to rewrite it on the moving interface. The elliptic component is represented using the periodic Green’s function for the Laplace equation, while the parabolic component is represented using the periodic heat kernel. This method reduces the bulk …

Nerve Constructions And Mapper, Alexander Bram Fritschi

Mathematics & Statistics ETDs

Mapper is a data visualization tool commonly used in topological data analysis to study large, often high-dimensional datasets. Mapper operates through the selection of a lens function, a clustering algorithm, and a cover. The Mapper graph is constructed using the nerve of the cover after the clustering algorithm is performed; it is therefore useful to study nerves to better understand Mapper. In this thesis, we will utilize the properties of nerves to find the minimal point set that produces a given graph. We will then extend this to Mapper to determine what Mapper graphs may be constructed over a given …

Interpretable Case-Control Inference Through Log-Linear General Location Models, Zacharia Stuart

Mathematics & Statistics ETDs

This dissertation analyzes one of the few publicly available NFL injury datasets to study field type and non-contact lower-limb injuries. Field type is studied jointly with other risk factors to understand how these factors interact to affect injury risk. The data were gathered through a case-control sampling scheme, which limits direct inference on absolute injury probabilities. While not the most common approach for case-control data, this dissertation models the retrospective distribution directly through Log-Linear General Location Models (Log-Linear GLOMs). Through a log-linear structure placed on a log-odds-ratio reparameterization, the model provides directly interpretable marginal and interaction contributions to injury log-odds …

The Uncertainty Principles, Lee Michael Felicetti

Mathematics & Statistics ETDs

The Heisenberg uncertainty principle is a central aspect of quantum mechanics, but also illustrates an essential quality of the Fourier transform. After Heisenberg, a variety of uncertainty inequalities emerged in the fields of physics and mathematics. In this thesis we will analyze the Heisenberg uncertainty principle in both the setting of quantum mechanics and Fourier analysis. We will then look at how the work of Heisenberg has been expanded upon in both physics and mathematics. Particularity, we will see how uncertainty principles can be applied to signal recovery and explore current research in this field.

Error-Tolerant Metric Dimension, Leander Ten Hoff

Master's Theses

Metric dimension is a graph parameter that measures the smallest distance-based unique coordinate system on a graph. Fault-tolerant metric dimension is a variant that requires redundancy. Inspired by this idea, we propose and investigate a new variant we call error-tolerant metric dimension. We first prove some fundamental results to gain familiarity with this more complex variant. Then, we use these tools to study relative behaviors of error-tolerant metric dimension. We prove explicit computations for simple graph families, including bipartite complete graphs and paths. Finally, we extend extremal results from previous papers on metric dimension, including a full correction of an …

The Relationship Between Foliations Of The Plane, Kaplan Diagrams, And Non-Hausdorff 1-Manifolds, Monique Justine Howe

Master's Theses

In this paper we seek to explain the relationship between foliations of the plane, Kaplan diagrams, and simply connected non-Hausdorff 1-manifolds with countable basis that are orientable with an ordering on branch points. We will walk the reader through the definitions of all of these objects, and provide examples with a focus on the motivating example of the Reeb foliation. This paper will describe and define the known bijection from the set of foliations of the plane, F, to the set of Kaplan diagrams, K, its inverse, and the one-to-one map from F to the set of simply connected non-Hausdorff …

Rewriting The Calculus 3 Workshop At San José State University, Moorea Lippert

Master's Theses

Calculus 3 at San José State University is a very important course for any student pursuing a STEM degree. However, the course is very challenging, so the university offers a supplemental workshop course for Calculus 3 students. Unfortunately, this workshop has not aligned with modern research in math education. This thesis documents efforts to recreate the workshop to better align with this modern research.