Physical Sciences and Mathematics Commons^™

On The Existence Of Periodic Traveling-Wave Solutions To Certain Systems Of Nonlinear, Dispersive Wave Equations, Jacob Daniels

All Graduate Theses and Dissertations, Fall 2023 to Present

A variety of physical phenomena can be modeled by systems of nonlinear, dispersive wave equations. Such examples include the propagation of a wave through a canal, deep ocean waves with small amplitude and long wavelength, and even the propagation of long-crested waves on the surface of lakes. An important task in the study of water wave equations is to determine whether a solution exists. This thesis aims to determine whether there exists solutions that both travel at a constant speed and are periodic for several systems of water wave equations. The work done in this thesis contributes to the subfields …

Vectors And Vector Borne Disease: Models For The Spread Of Curly Top Disease And Culex Mosquito Abundance, Rachel M. (Frantz) Georges

All Graduate Theses and Dissertations, Fall 2023 to Present

Mathematical models are useful tools in managing infectious disease. When designed appropriately, these models can provide insight into disease incidence patterns and transmission rates. In this work, we present several models that provide information that is useful in monitoring diseases spread by insects.

In the first part of this dissertation, we present two models that predict disease incidence patterns for Curly Top disease (CT) in tomato crops. CT affects a wide variety of plants and is spread through the bite of the Beet Leafhopper. This disease is particularly devastating to tomato crops. When infected, tomato plants present with stunted growth …

A Comprehensive Uncertainty Quantification Methodology For Metrology Calibration And Method Comparison Problems Via Numeric Solutions To Maximum Likelihood Estimation And Parametric Bootstrapping, Aloka B. S. N. Dayarathne

All Graduate Theses and Dissertations, Fall 2023 to Present

In metrology, the science of measurements, straight line calibration models are frequently employed. These models help understand the instrumental response to an analyte, whose chemical constituents are unknown, and predict the analyte’s concentration in a sample. Techniques such as ordinary least squares and generalized least squares are commonly used to fit these calibration curves. However, these methods may yield biased estimates of slope and intercept when the calibrant, substance used to calibrate an analytical procedure with known chemical constituents (x-values), carries uncertainty. To address this, Ripley and Thompson (1987) proposed functional relationship estimation by maximum likelihood (FREML), which considers uncertainties …

On Cheeger Constants Of Knots, Robert Lattimer

Electronic Theses, Projects, and Dissertations

In this thesis, we will look at finding bounds for the Cheeger constant of links. We will do this by analyzing an infinite family of links call two-bridge fully augmented links. In order to find a bound on the Cheeger constant, we will look for the Cheeger constant of the link’s crushtacean. We will use that Cheeger constant to give us insight on a good cut for the link itself, and use that cut to obtain a bound. This method gives us a constructive way to find an upper bound on the Cheeger constant of a two-bridge fully augmented link. …

Information Based Approach For Detecting Change Points In Inverse Gaussian Model With Applications, Alexis Anne Wallace

Electronic Theses, Projects, and Dissertations

Change point analysis is a method used to estimate the time point at which a change in the mean or variance of data occurs. It is widely used as changes appear in various datasets such as the stock market, temperature, and quality control, allowing statisticians to take appropriate measures to mitigate financial losses, operational disruptions, or other adverse impacts. In this thesis, we develop a change point detection procedure in the Inverse Gaussian (IG) model using the Modified Information Criterion (MIC). The IG distribution, originating as the distribution of the first passage time of Brownian motion with positive drift, offers …

Tasks For Learning Trigonometry, Sydnee Andreasen

All Graduate Reports and Creative Projects, Fall 2023 to Present

Many studies have been done using task-based learning within different mathematics courses. Within the field of trigonometry, task-based learning is lacking. The following research aimed to create engaging, mathematically rich tasks that meet the standards for the current trigonometry course at Utah State University and align with the State of Utah Core Standards for 7th through 12th grades. Four lessons were selected and developed based on the alignment of standards, the relevance to the remainder of the trigonometry course, and the relevance to courses beyond trigonometry. The four lessons that were chosen and developed were related to trigonometric ratios, graphing …

Mathematical Modeling For Dental Decay Prevention In Children And Adolescents, Mahdiyeh Soltaninejad

Dissertations

The high prevalence of dental caries among children and adolescents, especially those from lower socio-economic backgrounds, is a significant nationwide health concern. Early prevention, such as dental sealants and fluoride varnish (FV), is essential, but access to this care remains limited and disparate. In this research, a national dataset is utilized to assess sealants' reach and effectiveness in preventing tooth decay, particularly focusing on 2nd molars that emerge during early adolescence, a current gap in the knowledge base. FV is recommended to be delivered during medical well-child visits to children who are not seeing a dentist. Challenges and facilitators in …

The Lowest Discriminant Ideal Of Cayley-Hamilton Hopf Algebras, Zhongkai Mi

LSU Doctoral Dissertations

Discriminant ideals are defined for an algebra R with central subalgebra C and trace tr : R → C. They are indexed by positive integers and more general than discriminants. Usually R is required to be a finite module over C. Unlike the abundace of work on discriminants, there is hardly any literature on discriminant ideals. The levels of discriminant ideals relate to the sums of squares of dimensions of irreducible modules over maximal ideals of C containing these discriminant ideals. We study the lowest level when R is a Cayley-Hamilton Hopf algebra, i.e. C is also a Hopf subalgebra, …

Finite Monodromy And Artin Representations, Emma Lien

LSU Doctoral Dissertations

Artin representations, which are complex representations of finite Galois groups, appear in many contexts in number theory. The Langlands program predicts that Galois representations like these should arise from automorphic representations and many examples of this correspondence have been found such as in the proof of Fermat's Last Theorem. This dissertation aims to make an analysis of explicitly computable examples of Artin representations from both sides of this correspondence. On the automorphic side, certain weight 1 modular forms have been shown to be related to Artin representations and an explicit analysis of their Fourier coefficients allows us to identify the …

Reducibility Of Schrödinger Operators On Multilayer Graphs, Jorge Villalobos Alvarado

LSU Doctoral Dissertations

A local defect in an atomic structure can engender embedded eigenvalues when the associated Schrödinger operator is either block reducible or Fermi reducible, and having multilayer structures appears to be typically necessary for obtaining such types of reducibility. Discrete and quantum graph models are commonly used in this context as they often capture the relevant features of the physical system in consideration.

This dissertation lays out the framework for studying different types of multilayer discrete and quantum graphs that enjoy block or Fermi reducibility. Schrödinger operators with both electric and magnetic potentials are considered. We go on to construct a …

Subroups Of Coxeter Groups And Stallings Foldings, Jake A. Murphy

LSU Doctoral Dissertations

For each finitely generated subgroup of a Coxeter group, we define a cell complex called a completion. We show that these completions characterizes the index and normality of the subgroup. We construct a completion corresponding to the intersection of two subgroups and use this construction to characterize malnormality of subgroups of right-angled Coxeter groups. Finally, we show that if a completion of a subgroup is finite, then the subgroup is quasiconvex. Using this, we show that certain reflection subgroups of a Coxeter are quasiconvex.

Analytic Wavefront Sets Of Spherical Distributions On The De Sitter Space, Iswarya Sitiraju

LSU Doctoral Dissertations

In this work, we determine the wavefront set of certain eigendistributions of the Laplace-Beltrami operator on the de Sitter space. Let G′ = O_1,n(R) be the Lorentz group, and let H′ = O_1,n−1(R) ⊂ G′ be its subset. The de Sitter space dSⁿ is a one-sheeted hyperboloid in R^1,n isomorphic to G′/H′. A spherical distribution is an H′-invariant eigendistribution of the Laplace-Beltrami operator on dSⁿ. The space of spherical distributions with eigenvalue λ, denoted by D_λ^H'(dSⁿ), has dimension 2. We construct a basis for the space of …

The Modular Generalized Springer Correspondence For The Symplectic Group, Joseph Dorta

LSU Doctoral Dissertations

The Modular Generalized Springer Correspondence (MGSC), as developed by Achar, Juteau, Henderson, and Riche, stands as a significant extension of the early groundwork laid by Lusztig's Springer Correspondence in characteristic zero which provided crucial insights into the representation theory of finite groups of Lie type. Building upon Lusztig's work, a generalized version of the Springer Correspondence was later formulated to encompass broader contexts.

In the realm of modular representation theory, Juteau's efforts gave rise to the Modular Springer Correspondence, offering a framework to explore the interplay between algebraic geometry and representation theory in positive characteristic. Achar, Juteau, Henderson, and Riche …

Applications Of Survival Estimation Under Stochastic Order To Cancer: The Three Sample Problem, Sage Vantine

Honors Program Theses and Research Projects

Stochastic ordering of probability distributions holds various practical applications. However, in real-world scenarios, the empirical survival functions extracted from actual data often fail to meet the requirements of stochastic ordering. Consequently, we must devise methods to estimate these distribution curves in order to satisfy the constraint. In practical applications, such as the investigation of the time of death or the progression of diseases like cancer, we frequently observe that patients with one condition are expected to exhibit a higher likelihood of survival at all time points compared to those with a different condition. Nevertheless, when we attempt to fit a …

Birkhoff Summation Of Irrational Rotations: A Surprising Result For The Golden Mean, Heather Moore

University Honors Theses

This thesis presents a surprising result that the difference in a certain sums of constant rotations by the golden mean approaches exactly 1/5. Specifically, we focus on the Birkhoff sums of these rotations, with the number of terms equal to squared Fibonacci numbers. The proof relies on the properties of continued fraction approximants, Vajda's identity and the explicit formula for the Fibonacci numbers.

Understanding Waveguides In Resonance, Pieter Johannes Daniel Vandenberge

Dissertations and Theses

Several important classes of modern optical waveguides, including anti-resonant reflecting and photonic bandgap fibers, make use of geometries that guide energy in low refractive index material, a property that makes them of significant interest in numerous applications, notably including high-power delivery and guidance. These waveguides frequently exhibit resonance phenomena, in which their ability to propagate an input signal is sharply curtailed at particular operating frequencies. In this work we detail new advances in understanding these resonance effects and their implications for numerical modeling of these structures.

Part 1 focuses on the fields of slab waveguides, relatively simple structures for which …

A Causal Inference Approach For Spike Train Interactions, Zach Saccomano

Dissertations, Theses, and Capstone Projects

Since the 1960s, neuroscientists have worked on the problem of estimating synaptic properties, such as connectivity and strength, from simultaneously recorded spike trains. Recent years have seen renewed interest in the problem coinciding with rapid advances in experimental technologies, including an approximate exponential increase in the number of neurons that can be recorded in parallel and perturbation techniques such as optogenetics that can be used to calibrate and validate causal hypotheses about functional connectivity. This thesis presents a mathematical examination of synaptic inference from two perspectives: (1) using in vivo data and biophysical models, we ask in what cases the …

New Algorithmic Support For The Fundamental Theorem Of Algebra, Vitaly Zaderman

Dissertations, Theses, and Capstone Projects

Univariate polynomial root-finding is a venerated subjects of Mathematics and Computational Mathematics studied for four millenia. In 1924 Herman Weyl published a seminal root-finder and called it an algorithmic proof of the Fundamental Theorem of Algebra. Steve Smale in 1981 and Arnold Schonhage in 1982 proposed to classify such algorithmic proofs in terms of their computational complexity. This prompted extensive research in 1980s and 1990s, culminated in a divide-and-conquer polynomial root-finder by Victor Pan at ACM STOC 1995, which used a near optimal number of bit-operations. The algorithm approximates all roots of a polynomial p almost as fast as one …

Construction Of Quot-Schemes, Majid Dehghani

Electronic Theses and Dissertations

The Quot Scheme is a construction representing parameter spaces for quotient objects of sheaves or coherent modules over a scheme. It encapsulates families of quotients by fixing a certain quotient's structure. The Hilbert Scheme, a specific type of Quot Scheme, focuses on parameterizing subschemes of a fixed projective space by fixing their Hilbert polynomials. After recalling the basic concepts of the theory, we explain the Grothendieck’s Quot scheme construction and its Grassmannian embedding. Then we continue to an explicit construction of Quot scheme in the case of graded modules over graded rings.

On A Class Of James-Stein’S Estimators In High-Dimensional Data, Arash Aghaei Foroushani

Electronic Theses and Dissertations

In this thesis, we consider the estimation problem of the mean matrix of a multivariate normal distribution in high-dimensional data. Building upon the groundwork laid by Chételat and Wells (2012), we extend their method to the cases where the parameter is the mean matrix of a matrix normal distribution. In particular, we propose a novel class of James-Stein’s estimators for the mean matrix of a multivariate normal distribution with an unknown row covariance matrix and independent columns. Given a realistic assumption, we establish that our proposed estimator outperforms the classical maximum likelihood estimator (MLE) in the context of high-dimensional data. …

The Independence Polynomial Of A Graph At −1, Phoebe Rose Zielonka

Theses, Dissertations and Culminating Projects

No abstract provided.

Computing The Canonical Ring Of Certain Stacks, Jesse Franklin

Graduate College Dissertations and Theses

We compute the canonical ring of some stacks. We first give a detailed account of what this problem means including several proofs of a famous historical example. The main body of work of this thesis expands on our article \cite{Franklin-geometry-Drinfeld-modular-forms} in describing the geometry of Drinfeld modular forms as sections of a specified line bundle on a certain stacky modular curve. As a consequence of that geometry, we provide a program: one can compute the (log) canonical ring of a stacky curve to determine generators and relations for an algebra of Drinfeld modular forms, answering a problem posed by Gekeler …

Multiscale Modelling Of Brain Networks And The Analysis Of Dynamic Processes In Neurodegenerative Disorders, Hina Shaheen

Theses and Dissertations (Comprehensive)

The complex nature of the human brain, with its intricate organic structure and multiscale spatio-temporal characteristics ranging from synapses to the entire brain, presents a major obstacle in brain modelling. Capturing this complexity poses a significant challenge for researchers. The complex interplay of coupled multiphysics and biochemical activities within this intricate system shapes the brain's capacity, functioning within a structure-function relationship that necessitates a specific mathematical framework. Advanced mathematical modelling approaches that incorporate the coupling of brain networks and the analysis of dynamic processes are essential for advancing therapeutic strategies aimed at treating neurodegenerative diseases (NDDs), which afflict millions of …

The Deep Bsde Method, Daniel Kovach

Masters Theses

"The curse of dimensionality is the non-linear growth in computing time as the dimension of a problem increases. Using the Deep Backwards Stochastic Differential Equation (Deep BSDE) method developed in [HJE18], I approximate the solution at an initial time to a one-dimensional diffusion equation. Although we only approximate a one-dimensional equation, this method extends well to higher dimensions because it overcomes the curse of dimensionality by evaluating the given partial differential equation along "random characteristics''. In addition to the implementation, I also present most of the mathematical theory needed to understand this method"-- Abstract, p. iii

Counting Conjugates Of Colored Compositions, Jesus Omar Sistos Barron

Honors College Theses

The properties of n-color compositions have been studied parallel to those of regular compositions. The conjugate of a composition as defined by MacMahon, however, does not translate well to n-color compositions, and there is currently no established analogous concept. We propose a conjugation rule for cyclic n-color compositions. We also count the number of self-conjugates under these rules and establish a couple of connections between these and regular compositions.

Solutions To The Kaluza-Klein Field Equations, Abel Eshete

All Graduate Theses, Dissertations, and Other Capstone Projects

This Alternate Paper Plan explores Kaluza-Klein theory, a multidimensional framework designed to unify Einstein’s gravitational field theory and Maxwell’s electromagnetic field theory. The objectives of this research can be summarized in two key areas: The first objective is to present a comprehensive introduction to the compactified Kaluza-Klein theory. The second aim involves the application of differential geometry, specifically E ́lie Cartan’s tetrad formalism, to derive exact solutions in two distinct scenarios: a. A Levi-Civita spacetime, b. A general spherical system. Furthermore, Lagrangian and Hamiltonian formalism are utilized to define stability conditions and describe gravitational lensing and Precession of Perihelion within …

Graph Coloring Reconfiguration, Reem Mahmoud

Theses and Dissertations

Reconfiguration is the concept of moving between different solutions to a problem by transforming one solution into another using some prescribed transformation rule (move). Given two solutions s₁ and s₂ of a problem, reconfiguration asks whether there exists a sequence of moves which transforms s₁ into s₂. Reconfiguration is an area of research with many contributions towards various fields such as mathematics and computer science.
The k-coloring reconfiguration problem asks whether there exists a sequence of moves which transforms one k-coloring of a graph G into another. A move in this case is a type …

Edge Colored And Edge Ordered Graphs, Per Gustin Wagenius

Graduate College Dissertations and Theses

In this work, the current state of the field of edge-colored graphs is surveyed. Anew concept of unshrinkable edge colorings is introduced which is useful for rainbow subgraph problems and interesting in its own right. This concept is analyzed in some depth. Building upon the linear edge ordering described in a recent work from Gerbner, Methuku, Nagy, Pálvölgyi, Tardos, and Vizer, edge-ordering graphs with the cyclic group is introduced and some results are given on this and a related counting problem.

Echolocation On Manifolds, Kerong Wang

Honors Theses

We consider the question asked by Wyman and Xi [WX23]: ``Can you hear your location on a manifold?” In other words, can you locate a unique point x on a manifold, up to symmetry, if you know the Laplacian eigenvalues and eigenfunctions of the manifold? In [WX23], Wyman and Xi showed that echolocation holds on one- and two-dimensional rectangles with Dirichlet boundary conditions using the pointwise Weyl counting function. They also showed echolocation holds on ellipsoids using Gaussian curvature.

In this thesis, we provide full details for Wyman and Xi's proof for one- and two-dimensional rectangles and we show that …

Classification In Supervised Statistical Learning With The New Weighted Newton-Raphson Method, Toma Debnath

Electronic Theses and Dissertations

In this thesis, the Weighted Newton-Raphson Method (WNRM), an innovative optimization technique, is introduced in statistical supervised learning for categorization and applied to a diabetes predictive model, to find maximum likelihood estimates. The iterative optimization method solves nonlinear systems of equations with singular Jacobian matrices and is a modification of the ordinary Newton-Raphson algorithm. The quadratic convergence of the WNRM, and high efficiency for optimizing nonlinear likelihood functions, whenever singularity in the Jacobians occur allow for an easy inclusion to classical categorization and generalized linear models such as the Logistic Regression model in supervised learning. The WNRM is thoroughly investigated …