We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We investigate the approximation of quadratic Dirichlet $L$-functions over function fields by truncations of their Euler products. We first establish representations for such $L$-functions as products over prime polynomials times products over their zeros. This is the hybrid formula in function fields. We then prove that partial Euler products are good approximations of an $L$-function away from its zeros and that, when the length of the product tends to infinity, we recover the original $L$-function. We also obtain explicit expressions for the arguments of quadratic Dirichlet $L$-functions over function fields and for the arguments of their partial Euler products. In the second part of the paper we construct, for each quadratic Dirichlet $L$-function over a function field, an auxiliary function based on the approximate functional equation that equals the $L$-function on the critical line. We also construct a parametrized family of approximations of these auxiliary functions and prove that the Riemann hypothesis holds for them and that their zeros are related to those of the associated $L$-function. Finally, we estimate the counting function for the zeros of this family of approximations, show that these zeros cluster near those of the associated $L$-function, and that, when the parameter is not too large, almost all the zeros of the approximations are simple.
In this article we study various forms of $\ell$-independence (including the case $\ell =p$) for the cohomology and fundamental groups of varieties over finite fields and equicharacteristic local fields. Our first result is a strong form of $\ell$-independence for the unipotent fundamental group of smooth and projective varieties over finite fields. By then proving a certain ‘spreading out’ result we are able to deduce a much weaker form of $\ell$-independence for unipotent fundamental groups over equicharacteristic local fields, at least in the semistable case. In a similar vein, we can also use this to deduce $\ell$-independence results for the cohomology of smooth and proper varieties over equicharacteristic local fields from the well-known results on $\ell$-independence for smooth and proper varieties over finite fields. As another consequence of this ‘spreading out’ result we are able to deduce the existence of a Clemens–Schmid exact sequence for formal semistable families. Finally, by deforming to characteristic $p$, we show a similar weak version of $\ell$-independence for the unipotent fundamental group of a semistable curve in mixed characteristic.
Let $C/\mathbf{Q}$ be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of $\mathbf{Q}$, but may not have a hyperelliptic model of the usual form over $\mathbf{Q}$. We describe an algorithm that computes the local zeta functions of $C$ at all odd primes of good reduction up to a prescribed bound $N$. The algorithm relies on an adaptation of the ‘accumulating remainder tree’ to matrices with entries in a quadratic field. We report on an implementation and compare its performance to previous algorithms for the ordinary hyperelliptic case.
We present an efficient algorithm to compute the Hasse–Witt matrix of a hyperelliptic curve $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}C/\mathbb{Q}$ modulo all primes of good reduction up to a given bound $N$, based on the average polynomial-time algorithm recently proposed by the first author. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for $N = 2^{26}$.
This paper introduces ‘hyper-and-elliptic-curve cryptography’, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).
Let $ \mathcal{X} $ be a curve over ${ \mathbb{F} }_{q} $ and let $N( \mathcal{X} )$, $g( \mathcal{X} )$ be its number of rational points and genus respectively. The Ihara constant $A(q)$ is defined by $A(q)= {\mathrm{lim~sup} }_{g( \mathcal{X} )\rightarrow \infty } N( \mathcal{X} )/ g( \mathcal{X} )$. In this paper, we employ a variant of Serre’s class field tower method to obtain an improvement of the best known lower bounds on $A(2)$ and $A(3)$.
We prove that under any projective embedding of an abelian variety A of dimension g, a complete set of addition laws has cardinality at least g+1, generalizing a result of Bosma and Lenstra for the Weierstrass model of an elliptic curve in ℙ2. In contrast, we prove, moreover, that if k is any field with infinite absolute Galois group, then there exists for every abelian variety A/k a projective embedding and an addition law defined for every pair of k-rational points. For an abelian variety of dimension 1 or 2, we show that this embedding can be the classical Weierstrass model or the embedding in ℙ15, respectively, up to a finite number of counterexamples for ∣k∣≤5 .
Let k be a field of characteristic other than 2. There can be an obstruction to a principally polarized abelian threefold (A,a) over k, which is a Jacobian over , being a Jacobian over k; this can be computed in terms of the rationality of the square root of the value of a certain Siegel modular form. We show how to do this explicitly for principally polarized abelian threefolds which are the third power of an elliptic curve with complex multiplication. We use our numerical results to prove or refute the existence of some optimal curves of genus 3.
We study the fluctuations in the distribution of zeros of zeta functions of a family of hyperelliptic curves defined over a fixed finite field, in the limit of large genus. According to the Riemann hypothesis for curves, the zeros all lie on a circle. Their angles are uniformly distributed, so for a curve of genus g a fixed interval ℐ will contain asymptotically 2g∣ℐ∣ angles as the genus grows. We show that for the variance of number of angles in ℐ is asymptotically (2/π2)log (2g∣ℐ∣) and prove a central limit theorem: the normalized fluctuations are Gaussian. These results continue to hold for shrinking intervals as long as the expected number of angles 2g∣ℐ∣ tends to infinity.
This paper concerns towers of curves over a finite field with many rational points, following Garcia–Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian differential equations modulo p. We apply our results to towers of modular curves, and find new asymptotically good towers.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.