Algebraic Geometry Commons^™

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, 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), 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, 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, 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, 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, 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, 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 …