Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algebraic geometry (1)
- Computer algebra (1)
- Computer algebra software (1)
- Coninvolutory matrices (1)
- Dynamic multithreading (1)
-
- Elliptic Curve (1)
- Fulton’s algorithm (1)
- Function Field (1)
- Grace's theorem (1)
- Hensel lifting (1)
- Intersection multiplicity (1)
- Invariant circles (1)
- Irregular parallelism (1)
- L-Function (1)
- Locus of complex polynomial (1)
- Middle Extension Sheaf (1)
- Mobius transformation (1)
- Multi-affine polynomial (1)
- Néron Model (1)
- Polynomial system solving (1)
- Regular chains (1)
- Regular sequence (1)
- Triangular decomposition (1)
- Étale Cohomology (1)
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Reduction Of L-Functions Of Elliptic Curves Modulo Integers, Félix Baril Boudreau
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
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
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
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 …