Algebraic Geometry Commons^™

Interpolation Problems And The Characterization Of The Hilbert Function, Bryant Xie

Mathematical Sciences Undergraduate Honors Theses

In mathematics, it is often useful to approximate the values of functions that are either too awkward and difficult to evaluate or not readily differentiable or integrable. To approximate its values, we attempt to replace such functions with more well-behaving examples such as polynomials or trigonometric functions. Over the algebraically closed field C, a polynomial passing through r distinct points with multiplicities m1, ..., mr on the affine complex line in one variable is determined by its zeros and the vanishing conditions up to its mi − 1 derivative for each point. A natural question would then be to consider …

Elliptic Curves Over Finite Fields, Christopher S. Calger

Honors Theses

The goal of this thesis is to give an expository report on elliptic curves over finite fields. We begin by giving an overview of the necessary background in algebraic geometry to understand the definition of an elliptic curve. We then explore the general theory of elliptic curves over arbitrary fields, such as the group structure, isogenies, and the endomorphism ring. We then study elliptic curves over finite fields. We focus on the number of F_q-rational solutions, Tate modules, supersingular curves, and applications to elliptic curves over Q. In particular, we approach the topic largely through the use …

Surjectivity Of The Wahl Map On Cubic Graphs, Angela C. Hanson

Theses and Dissertations--Mathematics

Much of algebraic geometry is the study of curves. One tool we use to study curves is whether they can be embedded in a K3 surface or not. If the Wahl map is surjective on a curve, that curve cannot be embedded in a K3 surface. Therefore, studying if the Wahl map is surjective for a particular curve gives us more insight into the properties of that curve. We simplify this problem by converting graph curves to dual graphs. Then the information for graphs can be used to study the underlying curves. We will discuss conditions for the Wahl map …

Explorations In Well-Rounded Lattices, Tanis Nielsen

HMC Senior Theses

Lattices are discrete subgroups of Euclidean spaces. Analogously to vector spaces, they can be described as spans of collections of linearly independent vectors, but with integer (instead of real) coefficients. Lattices have many fascinating geometric properties and numerous applications, and lattice theory is a rich and active field of theoretical work. In this thesis, we present an introduction to the theory of Euclidean lattices, along with an overview of some major unsolved problems, such as sphere packing. We then describe several more specialized topics, including prior work on well-rounded ideal lattices and some preliminary results on the study of planar …

Studying Extended Sets From Young Tableaux, Eric Nofziger

Rose-Hulman Undergraduate Mathematics Journal

Young tableaux are combinatorial objects related to the partitions of an integer and have various applications in representation theory. They are particularly useful in the study of the fibers arising from the Springer resolution. In recent work of Graham-Precup-Russell, an association has been made between a given row-strict tableau and three disjoint subsets of {1,2,...,n}. These subsets are then used in the study of extended Springer fibers, so we call them extended sets. In this project, we use combinatorial techniques to classify which of these extended sets correlate to a valid row-strict or standard tableau and give bounds on the …

A Cluster Structure On The Coordinate Ring Of Partial Flag Varieties, Fayadh Kadhem

LSU Doctoral Dissertations

The main goal of this dissertation is to show that the (multi-homogeneous) coordinate ring of a partial flag variety C[G/P_K^−] contains a cluster algebra for every semisimple complex algebraic group G. We use derivation properties and a canonical lifting map to prove that the cluster algebra structure A of the coordinate ring C[N_K] of a Schubert cell constructed by Goodearl and Yakimov can be lifted, in an explicit way, to a cluster structure \hat{A} living in the coordinate ring of the corresponding partial flag variety. Then we use a minimality condition to prove that the cluster algebra \hat{A} is equal …

The Local Lifting Problem For Curves With Quaternion Actions, George Mitchell

Dissertations, Theses, and Capstone Projects

The lifting problem asks whether one can lift Galois covers of curves defined over positive characteristic to Galois covers of curves over characteristic zero. The lifting problem has an equivalent local variant, which asks if a Galois extension of complete discrete valuation rings over positive characteristic, with algebraically closed residue field, can be lifted to characteristic zero. In this dissertation, we content ourselves with the study of the local lifting problem when the prime is 2, and the Galois group of the extension is the group of quaternions. In this case, it is known that certain quaternion extensions cannot be …

Generalization Of Bi-Canonical Degrees, Joseph Brennan, Laura Ghezzi, Jooyoun Hong, Wolmer Vasconcelos

Publications and Research

We discuss invariants of Cohen-Macaulay local rings that admit a canonical module ω. Attached to each such ring R, when ω is an ideal, there are integers–the type of R, the reduction number of ω–that provide valuable metrics to express the deviation of R from being a Gorenstein ring. In (Ghezzi et al. in JMS 589:506–528, 2017) and (Ghezzi et al. in JMS 571:55–74, 2021) we enlarged this list with the canonical degree and the bi-canonical degree. In this work we extend the bi-canonical degree to rings where ω is not necessarily an ideal. We also discuss generalizations to rings …

Reduction Of L-Functions Of Elliptic Curves Modulo Integers, Félix Baril Boudreau

Electronic Thesis and Dissertation Repository

Let $\mathbb{F}_q$ be a finite field of size $q$, where $q$ is a power of a prime $p \geq 5$. Let $C$ be a smooth, proper, and geometrically connected curve over $\mathbb{F}_q$. Consider an elliptic curve $E$ over the function field $K$ of $C$ with nonconstant $j$-invariant. One can attach to $E$ its $L$-function $L(T,E/K)$, which is a generating function that contains information about the reduction types of $E$ at the different places of $K$. The $L$-function of $E/K$ was proven to be a polynomial in $\mathbb{Z}[T]$.

In 1985, Schoof devised an algorithm to compute the zeta function of an …

The Design And Implementation Of A High-Performance Polynomial System Solver, Alexander Brandt

Electronic Thesis and Dissertation Repository

This thesis examines the algorithmic and practical challenges of solving systems of polynomial equations. We discuss the design and implementation of triangular decomposition to solve polynomials systems exactly by means of symbolic computation.

Incremental triangular decomposition solves one equation from the input list of polynomials at a time. Each step may produce several different components (points, curves, surfaces, etc.) of the solution set. Independent components imply that the solving process may proceed on each component concurrently. This so-called component-level parallelism is a theoretical and practical challenge characterized by irregular parallelism. Parallelism is not an algorithmic property but rather a geometrical …

Identifying Trace Affine Linear Sets Using Homotopy Continuation, Julianne Mckay

All Theses

We investigate how the coefficients of a sparse polynomial system influence the sum, or the trace, of its solutions. We discuss an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of the support of a sparse polynomial system use sparse resultants and polyhedral geometry, respectively. We introduce a new approach which provides more precise classifications of trace affine linear sets than was previously known. For this new approach, we developed software in Macaulay2.

Recognizing And Reducing Ambiguity In Mathematics Curriculum And Relations Of Θ-Functions In Genus One And Two: A Geometric Perspective, Shantel Spatig

All Graduate Plan B and other Reports

Anxiety and mathematics come hand in hand for many individuals. This is due, in
part, to the fact that the only experience they have with mathematics is what some
mathematics educators refer to as "schoolmath," which uses a somewhat different
language than real mathematics. The language of schoolmath can cause individu-
als to have confusion and develop misconceptions related to several mathematical
concepts. One such concept is a fraction. In chapter one of this report, one possible
reason for this is discussed and a possible solution is purposed.
In chapter three of this report, genus-two curves admitting an elliptic involution …

Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova

Journal of Humanistic Mathematics

This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!

Bbt Acoustic Alternative Top Bracing Cadd Data Set-Norev-2022jun28, Bill Hemphill

STEM Guitar Project’s BBT Acoustic Kit

This electronic document file set consists of an overview presentation (PDF-formatted) file and companion video (MP4) and CADD files (DWG & DXF) for laser cutting the ETSU-developed alternate top bracing designs and marking templates for the STEM Guitar Project’s BBT (OM-sized) standard acoustic guitar kit. The three (3) alternative BBT top bracing designs in this release are
(a) a one-piece base for the standard kit's (Martin-style) bracing,
(b) 277 Ladder-style bracing, and
(c) an X-braced fan-style bracing similar to traditional European or so-called 'classical' acoustic guitars.

The CADD data set for each of the three (3) top bracing designs includes …

Bbt Side Mold Assy, Bill Hemphill

STEM Guitar Project’s BBT Acoustic Kit

This electronic document file set covers the design and fabrication information of the ETSU Guitar Building Project’s BBT (OM-sized) Side Mold Assy for use with the STEM Guitar Project’s standard acoustic guitar kit. The extended 'as built' data set contains an overview file and companion video, the 'parent' CADD drawing, CADD data for laser etching and cutting a drill &/or layout template, CADD drawings in AutoCAD .DWG and .DXF R12 formats of the centerline tool paths for creating the mold assembly pieces on an AXYZ CNC router, and support documentation for CAM applications including router bit specifications, feeds, speed, multi-pass …

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

The Zariski-Riemann Space As A Universal Model For The Birational Geometry Of A Function Field, Giovan Battista Pignatti Morano Di Custoza

Dissertations, Theses, and Capstone Projects

Given a function field $K$ over an algebraically closed field $k$, we propose to use the Zariski-Riemann space $\ZR (K/k)$ of valuation rings as a universal model that governs the birational geometry of the field extension $K/k$. More specifically, we find an exact correspondence between ad-hoc collections of open subsets of $\ZR (K/k)$ ordered by quasi-refinements and the category of normal models of $K/k$ with morphisms the birational maps. We then introduce suitable Grothendieck topologies and we develop a sheaf theory on $\ZR (K/k)$ which induces, locally at once, the sheaf theory of each normal model. Conversely, given a sheaf …

On Isomorphic K-Rational Groups Of Isogenous Elliptic Curves Over Finite Fields, Ben Kuehnert, Geneva Schlafly, Zecheng Yi

Rose-Hulman Undergraduate Mathematics Journal

It is well known that two elliptic curves are isogenous if and only if they have same number of rational points. In fact, isogenous curves can even have isomorphic groups of rational points in certain cases. In this paper, we consolidate all the current literature on this relationship and give a extensive classification of the conditions in which this relationship arises. First we prove two ordinary isogenous elliptic curves have isomorphic groups of rational points when they have the same $j$-invariant. Then, we extend this result to certain isogenous supersingular elliptic curves, namely those with equal $j$-invariant of either 0 …

The Examination Of The Arithmetic Surface (3, 5) Over Q, Rachel J. Arguelles

Electronic Theses, Projects, and Dissertations

This thesis is centered around the construction and analysis of the principal arithmetic surface (3, 5) over Q. By adjoining the two symbols i,j, where i² = 3, j² = 5, such that ij = -ji, I can produce a quaternion algebra over Q. I use this quaternion algebra to find a discrete subgroup of SL₂(R), which I identify with isometries of the hyperbolic plane. From this quaternion algebra, I produce a large list of matrices and apply them via Mobius transformations to the point (0, 2), which is the center of my Dirichlet domain. This …

Lattice Reduction Algorithms, Juan Ortega

Electronic Theses, Projects, and Dissertations

The purpose of this thesis is to propose and analyze an algorithm that follows
similar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applying
them to three-dimensions. We start off by discussing the importance of cryptography in
our day to day lives. Then we dive into some linear algebra and discuss specific topics that
will later help us in understanding lattice reduction algorithms. We discuss two lattice
problems: the shortest vector problem and the closest vector problem. Then we introduce
two types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensions
and the LLL Algortihm. We illustrate how both …