Algebraic Geometry Commons^™

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 …

Towards A Generalization Of Fulton's Intersection Multiplicity Algorithm, Ryan Sandford

Electronic Thesis and Dissertation Repository

In this manuscript we generalize Fulton's bivariate intersection multiplicity algorithm to a partial intersection multiplicity algorithm in the n-variate setting. We extend this generalization of Fulton's algorithm to work at any point, rational or not, using the theory of regular chains. We implement these algorithms in Maple and provide experimental testing. The results indicate the proposed algorithm often outperforms the existing standard basis-free intersection multiplicity algorithm in Maple, typically by one to two orders of magnitude. Moreover, we also provide some examples where the proposed algorithm outperforms intersection multiplicity algorithms which rely on standard bases, indicating the proposed algorithm is …

On The Geometry Of Multi-Affine Polynomials, Junquan Xiao

Electronic Thesis and Dissertation Repository

This work investigates several geometric properties of the solutions of the multi-affine polynomials. Chapters 1, 2 discuss two different notions of invariant circles. Chapter 3 gives several loci of polynomials of degree three. A locus of a complex polynomial p(z) is a minimal, with respect to inclusion, set that contains at least one point of every solution of the polarization of the polynomial. The study of such objects allows one to improve upon know results about the location of zeros and critical points of complex polynomials, see for example [22] and [24]. A complex polynomial has many loci. It is …

Equisingular Approximation Of Analytic Germs, Aftab Yusuf Patel

Electronic Thesis and Dissertation Repository

This thesis deals with the problem of approximating germs of real or complex analytic spaces by Nash or algebraic germs. In particular, we investigate the problem of approximating analytic germs in various ways while preserving the Hilbert-Samuel function, which is of importance in the resolution of singularities. We first show that analytic germs that are complete intersections can be arbitrarily closely approximated by algebraic germs which are complete intersections with the same Hilbert-Samuel function. We then show that analytic germs whose local rings are Cohen-Macaulay can be arbitrarily closely approximated by Nash germs whose local rings are Cohen- Macaulay and …

Cache-Friendly, Modular And Parallel Schemes For Computing Subresultant Chains, Mohammadali Asadi

Electronic Thesis and Dissertation Repository

The RegularChains library in Maple offers a collection of commands for solving polynomial systems symbolically with taking advantage of the theory of regular chains. The primary goal of this thesis is algorithmic contributions, in particular, to high-performance computational schemes for subresultant chains and underlying routines to extend that of RegularChains in a C/C++ open-source library.

Subresultants are one of the most fundamental tools in computer algebra. They are at the core of numerous algorithms including, but not limited to, polynomial GCD computations, polynomial system solving, and symbolic integration. When the subresultant chain of two polynomials is involved in a client …

Distribution Of The P-Torsion Of Jacobian Groups Of Regular Matroids, Sergio R. Zapata Ceballos

Electronic Thesis and Dissertation Repository

Given a regular matroid $M$ and a map $\lambda\colon E(M)\to \N$, we construct a regular matroid $M_\lambda$. Then we study the distribution of the $p$-torsion of the Jacobian groups of the family $\{M_\lambda\}_{\lambda\in\N^{E(M)}}$. We approach the problem by parameterizing the Jacobian groups of this family with non-trivial $p$-torsion by the $\F_p$-rational points of the configuration hypersurface associated to $M$. In this way, we reduce the problem to counting points over finite fields. As a result, we obtain a closed formula for the proportion of these groups with non-trivial $p$-torsion as well as some estimates. In addition, we show that the …

Albert Forms, Quaternions, Schubert Varieties & Embeddability, Jasmin Omanovic

Electronic Thesis and Dissertation Repository

The origin of embedding problems can be understood as an effort to find some minimal datum which describes certain algebraic or geometric objects. In the algebraic theory of quadratic forms, Pfister forms are studied for a litany of powerful properties and representations which make them particularly interesting to study in terms of embeddability. A generalization of these properties is captured by the study of central simple algebras carrying involutions, where we may characterize the involution by the existence of particular elements in the algebra. Extending this idea even further, embeddings are just flags in the Grassmannian, meaning that their study …

Essential Dimension Of Parabolic Bundles, Dinesh Valluri

Electronic Thesis and Dissertation Repository

Essential dimension of a geometric object is roughly the number of algebraically independent parameters needed to define the object. In this thesis we give upper bounds for the essential dimension of parabolic bundles over a non-singular curve X of genus g greater than or equal to 2 using Borne's correspondence between parabolic bundles on a curve and vector bundles on a root stack. This is a generalization of the work of Biswas, Dhillon and Hoffmann on the essential dimension of vector bundles, by following their method for curves and adapting it to root stacks. In this process, we invoke the …

Enhanced Koszulity In Galois Cohomology, Marina Palaisti

Electronic Thesis and Dissertation Repository

Despite their central role in Galois theory, absolute Galois groups remain rather mysterious; and one of the main problems of modern Galois theory is to characterize which profinite groups are realizable as absolute Galois groups over a prescribed field. Obtaining detailed knowledge of Galois cohomology is an important step to answering this problem. In our work we study various forms of enhanced Koszulity for quadratic algebras. Each has its own importance, but the common ground is that they all imply Koszulity. Applying this to Galois cohomology, we prove that, in all known cases of finitely generated pro-$p$-groups, Galois cohomology is …

On Vector-Valued Automorphic Forms On Bounded Symmetric Domains, Nadia Alluhaibi

Electronic Thesis and Dissertation Repository

The objective of the study is to investigate the behaviour of the inner products of vector-valued Poincare series, for large weight, associated to submanifolds of a quotient of the complex unit ball and how vector-valued automorphic forms could be constructed via Poincare series. In addition, it provides a proof of that vector-valued Poincare series on an irreducible bounded symmetric domain span the space of vector-valued automorphic forms.

Computation Of Real Radical Ideals By Semidefinite Programming And Iterative Methods, Fei Wang

Electronic Thesis and Dissertation Repository

Systems of polynomial equations with approximate real coefficients arise frequently as models in applications in science and engineering. In the case of a system with finitely many real solutions (the $0$ dimensional case), an equivalent system generates the so-called real radical ideal of the system. In this case the equivalent real radical system has only real (i.e., no non-real) roots and no multiple roots. Such systems have obvious advantages in applications, including not having to deal with a potentially large number of non-physical complex roots, or with the ill-conditioning associated with roots with multiplicity. There is a corresponding, but more …

K-Theory Of Root Stacks And Its Application To Equivariant K-Theory, Ivan Kobyzev

Electronic Thesis and Dissertation Repository

We give a definition of a root stack and describe its most basic properties. Then we recall the necessary background (Abhyankar’s lemma, Chevalley-Shephard-Todd theorem, Luna’s etale slice theorem) and prove that under some conditions a quotient stack is a root stack. Then we compute G-theory and K-theory of a root stack. These results are used to formulate the theorem on equivariant algebraic K-theory of schemes.

A Study Of Green’S Relations On Algebraic Semigroups, Allen O'Hara

Electronic Thesis and Dissertation Repository

The purpose of this work is to enhance the understanding regular algebraic semigroups by considering the structural influence of Green's relations. There will be three chief topics of discussion.

• Green's relations and the Adherence order on reductive monoids
• Renner’s conjecture on regular irreducible semigroups with zero
• a Green’s relation inspired construction of regular algebraic semigroups

Primarily, we will explore the combinatorial and geometric nature of reductive monoids with zero. Such monoids have a decomposition in terms of a Borel subgroup, called the Bruhat decomposition, which produces a finite monoid, R, the Renner monoid. We will explore the structure of …

Algorithms To Compute Characteristic Classes, Martin Helmer

Electronic Thesis and Dissertation Repository

In this thesis we develop several new algorithms to compute characteristics classes in a variety of settings. In addition to algorithms for the computation of the Euler characteristic, a classical topological invariant, we also give algorithms to compute the Segre class and Chern-Schwartz-MacPherson (CSM) class. These invariants can in turn be used to compute other common invariants such as the Chern-Fulton class (or the Chern class in smooth cases).

We begin with subschemes of a projective space over an algebraically closed field of characteristic zero. In this setting we give effective algorithms to compute the CSM class, Segre class and …

Computing Intersection Multiplicity Via Triangular Decomposition, Paul Vrbik

Electronic Thesis and Dissertation Repository

Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by triangular sets) and then, with some generic assumptions, to l many hypersurfaces.

Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at points on curves.

Tilting Sheaves On Brauer-Severi Schemes And Arithmetic Toric Varieties, Youlong Yan

Electronic Thesis and Dissertation Repository

The derived category of coherent sheaves on a smooth projective variety is an important object of study in algebraic geometry. One important device relevant for this study is the notion of tilting sheaf.

This thesis is concerned with the existence of tilting sheaves on some smooth projective varieties. The main technique we use in this thesis is Galois descent theory. We first construct tilting bundles on general Brauer-Severi varieties. Our main result shows the existence of tilting bundles on some Brauer-Severi schemes. As an application, we prove that there are tilting bundles on an arithmetic toric variety whose toric variety …

Characteristic Polynomial Of Arrangements And Multiarrangements, Mehdi Garrousian

Electronic Thesis and Dissertation Repository

This thesis is on algebraic and algebraic geometry aspects of complex hyperplane arrangements and multiarrangements. We start by examining the basic properties of the logarithmic modules of all orders such as their freeness, the cdga structure, the local properties and close the first chapter with a multiarrangement version of a theorem due to M. Mustata and H. Schenck.

In the next chapter, we obtain long exact sequences of the logarithmic modules of an arrangement and its deletion-restriction under the tame conditions. We observe how the tame conditions transfer between an arrangement and its deletion-restriction.

In chapter 3, we use some …