Gauss Composition And Orthogonal Modular Forms On Binary Lattices,
2026
Dartmouth College
Gauss Composition And Orthogonal Modular Forms On Binary Lattices, Haochen Wu
Dartmouth College Ph.D Dissertations
We revisit Gauss composition over a general base scheme, with a focus on orthogonal groups. We show that the Clifford and norm functors provide a discriminant-preserving equivalence of categories between binary quadratic modules and pseudoregular modules over quadratic algebras. This perspective synthesizes the constructions of Kneser and Wood, reconciling algebraic and geometric approaches and clarifying the role of orientations and the natural emergence of narrow class groups.
As an application, we restrict to lattices and show that binary orthogonal eigenforms correspond to Hecke characters. Using theta series, we show the explicit connection between Hilbert modular forms and orthogonal modular forms …
Classes Of Analytic Functions Defined By Salagean Derivative Operator Associated With Neutrosophic Generalized Poisson Distribution,
2026
Department of Pure and Applied Mathematics, Ladoke Akintola University of Technology, Ogbomoso, Nigeria
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 …
Toward The Salmon Prize: A Computational Certificate For The M5, M6, And M9 Equation Families Of Σ4(P3 × P3 × P3),
2026
The University of Texas Rio Grande Valley
Toward The Salmon Prize: A Computational Certificate For The M5, M6, And M9 Equation Families Of Σ4(P3 × P3 × P3), John Trevino
Theatre Faculty Publications
We present a computational certificate for three families of explicit polyno- mial equations whose zero locus contains the fourth secant variety σ4(P3×P3×P3) inside P63. The three families are: 192 degree-5 Strassen commutation equa- tions (M5); 160 degree-6 equations lifted from the Bates–Oeding generators of σ4(P2 × P2 × P3) via the Landsberg–Manivel–Friedland theorem (M6); and 64 degree-9 Ottaviani 9 × 9 determinant equations (M9). All 416 generators are explicit polynomials in the coordinate ring Z[Zijk | i, j, k ∈ {0, 1, 2, 3}]. We verify by exact integer arithmetic that every generator vanishes on rank-4 test tensors (six independent …
Parameterized Polynomial Systems: Monodromy, Sparse Polynomials, And Solutions,
2026
Clemson University
Parameterized Polynomial Systems: Monodromy, Sparse Polynomials, And Solutions, Julianne Barnhart
All Dissertations
The lift of a loop in the base space of a branched cover to the cover induces a permutation of points in a fibre. The monodromy group of the branched cover is the permutation group generated by all such permutations. When loops are restricted to a particular subset of the base space, the corresponding permutation group induced by these loops is the restricted monodromy group. Monodromy groups encode structure and symmetries of many enumerative problems. We describe the relationship between the restricted monodromy group and the monodromy group of the original branched cover. Our main result is a local-to-global property: …
Non-Redundant Rovibrational Hamiltonians By Molien Generating Functions And Gröbner-Basis Reduction,
2026
University of Louisville
Non-Redundant Rovibrational Hamiltonians By Molien Generating Functions And Gröbner-Basis Reduction, Leandro Ajo
University Libraries Undergraduate Research Award
High-resolution molecular spectroscopy requires an effective Hamiltonian whose operator content is both complete, containing every term allowed by molecular symmetry and nonredundant, free of any algebraically dependent operators that would cause ill-conditioned parameter fits. Traditional derivations based on Van Vleck contact transformations satisfy neither criterion automatically. This paper develops a rigorous, algorithmic pipeline that guarantees both properties simultaneously. Starting from the permutation– inversion (PI) group GPI of a molecule (Longuet-Higgins, 1963), we apply Molien’s theorem (Molien, 1897) to the symplectic normal-coordinate representation to obtain the vibrational generating function Φvib(t); integrate over the Haar measure of SO(3) (Weyl, 1946) to obtain …
Geovig And Purevig: Geometry-Aware Architectures For Efficient Computer Vision,
2026
Wilfrid Laurier University
Geovig And Purevig: Geometry-Aware Architectures For Efficient Computer Vision, Omar Ismail
Theses and Dissertations (Comprehensive)
Deploying deep learning models for medical image analysis on mobile devices requires a balance between inference latency, memory footprint, and delineating anatomical boundaries with high accuracy. While Convolutional Neural Networks (CNNs) and mobile Vision Transformers (ViTs) offer efficiency, they often struggle to model the irregular, non-local geometric structures inherent in biological tissues without incurring prohibitive computational costs. In this thesis, we introduce GeoViG (Geometric Vision Graph), an architecture that bridges the gap between efficient grid-based processing and explicit Geometric Deep Learning. GeoViG introduces a novel transition from high-resolution pixel grids to low-resolution dynamic graphs via a SpreadEdgePool operator, a geometry-aware …
Arrangements Of N Planes Resulting In One Bounded Tetrahedral Chamber,
2026
The University of Akron
Arrangements Of N Planes Resulting In One Bounded Tetrahedral Chamber, Ava Knight
Williams Honors College, Honors Research Projects
This paper investigates the combinatorial geometry of plane arrangements in three-dimensional space, focusing on configurations that produce exactly one bounded tetrahedral chamber. We define T(n) as the number of face-combinatorial equivalence classes of arrangements of n planes in ℝ³ containing exactly one bounded tetrahedral chamber. Known values — T(3) = 0, T(4) = 1, and T(5) = 2 — are established through direct construction, while T(6) remains an open problem. This paper contributes experimental evidence toward resolving T(6) by systematically extending the two valid 5-plane arrangements and verifying, through a plane removal argument, that each yields a valid plane configuration …
Catalan And Hyper-Catalan Numbers: Combinatorial Applications To Polynomial Equations,
2026
The University of Akron
Catalan And Hyper-Catalan Numbers: Combinatorial Applications To Polynomial Equations, Leilani Natale
Williams Honors College, Honors Research Projects
In this paper, we study Catalan numbers and their generalization, hyper-Catalan numbers, and explore how these sequences arise naturally in the context of solving polynomial equations using infinite power series. We begin by introducing the Catalan numbers through their combinatorial interpretation as triangulations of convex polygons. Using this geometric definition, we derive a relation whose recursive structure leads to a quadratic functional equation. Interpreting this relation as a formal power series equation allows us to express solutions to quadratic equations as infinite power series whose coefficients are given by the Catalan numbers. This framework is then extended by allowing polygon …
Principal Quandles,
2025
University of Denver
Principal Quandles, Jesse Parrish
Electronic Theses and Dissertations
This thesis concerns principal quandles and, as a special case, Alexander quandles. A principal quandle is a coset quandle, Q(G,H, f), in which the subgroup H is trivial. If in addition the group G is abelian, then the coset quandle is called an Alexander quandle. The isomorphism types of Alexander quandles were classified [16], and some progress was made on describing the isomorphism types of principal quandles in [14] and [13]. The first part of this thesis applies the ideas used in Holmes’ paper to give a classification of the isomorphism types of principal quandles. The second …
Growth Mindset In The Mathematics Classroom: Studying The Effects Of A Growth Mindset Intervention On High School Students In A Geometry Classroom,
2025
Bemidji State University
Growth Mindset In The Mathematics Classroom: Studying The Effects Of A Growth Mindset Intervention On High School Students In A Geometry Classroom, Katelyn Strauss
Mathematics Graduate Theses
Having a growth mindset is crucial to being successful in a mathematics classroom. However, many students believe themselves to be either “mathematics people” or “not mathematics people”. When students believe they are not a mathematics person, they are far less likely to engage in material where they face struggles, and thus they miss out on valuable learning. A review of the literature has show that students have been able to shift their mindset from fixed to growth through a series of interventions. I used a unit in Geometry to see how a growth mindset intervention would affect the mindset of …
(Si15-022) Five Efficient Cryptography Authentication Schemes With Functional Relation On General Spaces,
2025
Kalasalingam Academy of Research and Education
(Si15-022) Five Efficient Cryptography Authentication Schemes With Functional Relation On General Spaces, L. Sreenivasulu Reddy, S. Lakshmisri
Applications and Applied Mathematics: An International Journal (AAM)
This work addresses the growing demand for diversification in cryptographic schemes to secure communication. This work proposes a novel suite of algorithms, including two block ciphers (TPBlock and TAP-Block), two stream ciphers (TP-Stream and TAP-Stream), and a zero-knowledge proof scheme (F-zero knowledge proof). All schemes leverage functional relations defined over the real number space with a dimension greater than one for encryption, decryption, and key generation, offering an alternative to the number-theoretical aspects and algebraic structures commonly used in existing schemes. The main goal of this work is to introduce and propose these five novel cryptographic schemes to provide authentication …
Certified Approximation Algorithms Of Algebraic Curves,
2025
Clemson University
Certified Approximation Algorithms Of Algebraic Curves, Michael Byrd Jr.
All Dissertations
One of the fundamental problems in mathematics is to determine the set of solutions to a system of equations. In algebraic geometry, the equations studied are polynomials, and the solution set is called an algebraic variety. For single variable polynomials of degree less than five, the roots can be determined exactly using algebraic methods, but for polynomials of degree five or higher, numerical methods are required. When using numerical methods, it is important to know when the computed approximation is indeed a correct solution, which leads to the idea of a certified algorithm. An algorithm is said to be …
Certified Computation Of Julia Sets Via Numerical Methods,
2025
Clemson University
Certified Computation Of Julia Sets Via Numerical Methods, Hannah Kaufman
All Theses
The chaotic and fractal nature of Julia sets makes them difficult to graph. This research aims to provide graphical approximations of Julia sets with known and guaranteed levels of accuracy. We implement three methods to approximate Julia sets with c values chosen from the main cardioid of the Mandelbrot set. Each method utilizes different properties of these Julia sets. The exclusion method makes use of the fact that a Julia set of this type is topologically a circle. Attracting and repelling fixed points are used to find a region on the interior of the Julia set and a region on …
A Theory Of Fundamental Strata For Twisted Formal Connections,
2025
Louisiana State University and Agricultural and Mechanical College
A Theory Of Fundamental Strata For Twisted Formal Connections, Sorawit Viwanthananut
LSU Doctoral Dissertations
Let $G$ be a complex reductive group. A fundamental stratum for $G$ is a triple $(x,r,\beta)$ where $x$ is a point in the Bruhat-Tits building of $G$, $r$ is a nonnegative real number called depth of the stratum, and $\beta$ is a semistable functional on the Moy-Prasad filtration of $\fg$ associated to $x$ at level $r$. Fundamental strata were first introduced to classify admissible representations of a $p$-adic reductive group. More recently, Bremer and Sage have shown that fundamental strata play an important role in the geometric Langlands program and developed a theory of fundamental strata for $G$-connections. In this …
A Preliminary Study Of Hilbert–Kunz Functions: Coefficient Behavior In A Normal Affine Semigroup Ring,
2025
Texas A&M International University
A Preliminary Study Of Hilbert–Kunz Functions: Coefficient Behavior In A Normal Affine Semigroup Ring, Jesus A. Mendiola Herrera
Theses and Dissertations
In 1890, David Hilbert published a set of notes on what now constitutes one of the bases of Commutative Algebra; his work would eventually influence the efforts of mathematicians like Ernst Kunz. In 1969, Ernst Kunz introduced a particular mapping regarding modules of regular local rings. His goal was to characterize Noetherian local rings of prime characteristic by computing the length of the composition series under Frobenius power transformations. In this thesis, the focus will be on stating the initial steps on finding the coefficients of the Hilbert-Kunz function of the normal affine semigroup ring of the form R = …
A Zariski-Nagata Theorem For Smooth Toric Surfaces,
2025
University of Nebraska-Lincoln
A Zariski-Nagata Theorem For Smooth Toric Surfaces, Jordan Vincent Barrett
Dissertations and Doctoral Documents, University of Nebraska-Lincoln, 2023–
The Affine Zariski-Nagata theorem is a classical result in commutative algebra that gives an expression for the nth symbolic power of a radical ideal I in a polynomial ring over a field in terms of the nth ordinary powers of the maximal ideals in [affine variety]max(I). In this thesis we discuss a well-known projective analog of Zariski-Nagata and provide the necessary background on toric varieties to present a generalization of this result to toric surfaces. We conclude with a brief discussion about work toward characterizing which abstract toric varieties have smooth point fibers with …
Some Interpolation Problems In The Projective Plane,
2025
University of Arkansas, Fayetteville
Some Interpolation Problems In The Projective Plane, Lilah Estes
Mathematical Sciences Undergraduate Honors Theses
Given some set of r general points in the projective plane, we want to better understand: what is the smallest degree of any polynomial passing through the points m times? How many linearly independent equations of this degree pass through the points m times? The investigation of these questions, particularly for the case of m=3 and r< 16, motivates the development of several results. We translate Terracini's inductive argument, a tool for evaluating the expectedness of certain sets of double points, into a version which can be used for triple points, and prove that the argument holds. We compute the minimal graded free resolutions for the ideals corresponding to up to 15 points, for m up to 6, and we conjecture a connection between the expectedness of these ideals and what their resolutions look like. Further, we prove that this conjecture holds when m=1, and we either fully or partially prove that these ideals are …
Computer Vision In Soccer: Yolov11 Analytics Engine For Quantifying Game Strategy,
2025
University of Arkansas, Fayetteville
Computer Vision In Soccer: Yolov11 Analytics Engine For Quantifying Game Strategy, Connor S. Maurer
Data Science Undergraduate Honors Theses
Single-shot object detection capabilities significantly reduce computational overhead for real-time computer vision in sports analytics at 60 FPS. YOLO11’s lightweight CNN gives promising accuracy while meeting the low-latency demand of dynamic soccer matches. As data-driven approaches take over the sport of soccer, efficient player tracking systems become critical for informing coach’s strategies. I prototype the ETL (Extract, Transform, Load) process of data collected from a single- shot detection program and evaluate its viability for estimating player fatigue. YOLO11 detects players, the ball, and other characteristics, with the output transformed by homography to estimate the positions in the real world. These …
Navigating Geometry With Interactive Lessons: A Collection Of Resources In Geogebra That Address Frequently Held Misconceptions,
2025
University of Nebraska-Lincoln
Navigating Geometry With Interactive Lessons: A Collection Of Resources In Geogebra That Address Frequently Held Misconceptions, Sara Vance
Honors Program: Senior Projects (Public)
Nearly every high school student in the United States is required to take a geometry class, and for many, it’s unlike any math class they’ve taken before. Additionally, there are certain topics with which past and present geometry students alike tend to struggle. This project was created to address these issues; my goal is that these materials will help students better understand these topics and clear up their frequently held misconceptions about geometry. This project was supported by interviews I conducted with veteran high school geometry teachers with over 75 years of teaching math between them.
This collection of interactive …
Finite Posets As Prime Spectra Of Commutative Noetherian Rings,
2025
Mälardalen University
Finite Posets As Prime Spectra Of Commutative Noetherian Rings, David T. Alkass
Rose-Hulman Undergraduate Mathematics Journal
We study finite partially ordered sets of prime ideals as found in commutative Noetherian rings. In doing so, we establish that these posets have a bipartite structure and devise a construction for finding ring spectra that are order-isomorphic to many such posets. Specifically, we prove that any finite complete bipartite graph is order-isomorphic to the spectrum of a ring of essentially finite type over the field of rational numbers. Furthermore, we prove that prime spectra of such rings can also depict any finite path or even cycle.
