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 no-reply@cambridge.org
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.
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}$.
In his Tata Lecture Notes, Igusa conjectured the validity of a strong uniformity in the decay of complete exponential sums modulo powers of a prime number and determined by a homogeneous polynomial. This was proved for non-degenerate forms by Denef–Sperber and then by Cluckers for weighted homogeneous non-degenerate forms. In a recent preprint, Wright has proved this for degenerate binary forms. We give a different proof of Wright’s result that seems to be simpler and relies upon basic estimates for exponential sums mod $p$as well as a type of resolution of singularities with good reduction in the sense of Denef.
We prove the parity conjecture for the ranks of p-power Selmer groups (p⁄=2) of a large class of elliptic curves defined over totally real number fields.
We introduce an essentially new Grothendieck topology, the Weil-étale topology, on schemes over finite fields. The cohomology groups associated with this topology should behave better than the standard étale cohomology groups. In particular there is a very natural definition of an Euler characteristic and a plausible conjecture relating the Euler characteristic of Z to the value of the zeta-function at s = 0. This conjecture is proved in certain cases.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.