SearcharxivSearch

arXiv subjects

Jan Tuitman

Publications and source records attributed to Jan Tuitman.

9 recordsLinked to original sources

Quadratic Chabauty for modular curves: Algorithms and examples

We describe how the quadratic Chabauty method may be applied to explicitly determine the set of rational points on modular curves of genus $g>1$ whose Jacobians have Mordell--Weil rank $g$. This extends our previous work on the split Cartan curve of level 13 and allows us to consider modular curves that may have few known rational points or nontrivial local height contributions at primes of bad reduction. We illustrate our algorithms with a number of examples where we determine the set of rational points on several modular curves of genus 2 and 3: this includes Atkin--Lehner quotients $X_0^+(N)$ of prime level $N$, the curve $X_{S_4}(13)$, as well as a few other curves relevant to Mazur's Program B. We also describe the computation of rational points on the genus 6 non-split Cartan modular curve $X_{\textrm{ns}} ^+ (17)$.

math.NT

Explicit Coleman integration for curves

The Coleman integral is a $p$-adic line integral that plays a key role in computing several important invariants in arithmetic geometry. We give an algorithm for explicit Coleman integration on curves, using the algorithms of the second author to compute the action of Frobenius on $p$-adic cohomology. We present a collection of examples computed with our implementation. This includes integrals on a genus 55 curve, where other methods do not currently seem practical.

math.NT

Explicit Chabauty-Kim for the Split Cartan Modular Curve of Level 13

We extend the explicit quadratic Chabauty methods developed in previous work by the first two authors to the case of non-hyperelliptic curves. This results in an algorithm to compute the rational points on a curve of genus $g \ge 2$ over the rationals whose Jacobian has Mordell-Weil rank $g$ and Picard number greater than one, and which satisfies some additional conditions. This algorithm is then applied to the modular curve $X_{s}(13)$, completing the classification of non-CM elliptic curves over $\mathbf{Q}$ with split Cartan level structure due to Bilu-Parent and Bilu-Parent-Rebolledo.

math.NT

Computing zeta functions of generic projective hypersurfaces in larger characteristic

We give improvements of the deformation method for computing the zeta function of a generic projective hypersurface in characteristic~$p$ that either reduce the dependence on~$p$ of the time complexity to $\tilde{O}(p^{1/2})$ or that of the space complexity to $\tilde{O}(\log(p))$ while remaining polynomial in the other input parameters.

math.NT

Point counting on curves using a gonality preserving lift

We study the problem of lifting curves from finite fields to number fields in a genus and gonality preserving way. More precisely, we sketch how this can be done efficiently for curves of gonality at most four, with an in-depth treatment of curves of genus at most five over finite fields of odd characteristic, including an implementation in Magma. We then use such a lift as input to an algorithm due to the second author for computing zeta functions of curves over finite fields using $p$-adic cohomology.

math.NT

Counting points on curves using a map to P^1, II

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds, analyse the complexity of the algorithm and provide a complete implementation.

math.NT

Improvements to the deformation method for counting points on smooth projective hypersurfaces

We present various improvements to the deformation method for computing the zeta function of smooth projective hypersurfaces over finite fields using $p$-adic cohomology. This includes new bounds for the $p$-adic and $t$-adic precisions required to obtain provably correct results and gains in the efficiency of the individual steps of the method. The algorithm that we thus obtain has lower time and space complexities than existing methods. Moreover, our implementation is more practical and can be applied more generally, which we illustrate with examples of quintic curves and quartic surfaces.

math.NT

Counting points on curves using a map to P^1

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds, analyse the complexity of the algorithm and provide some examples computed with our implementation.

math.NT

Effective convergence bounds for Frobenius structures on connections

Consider a meromorphic connection on P^1 over a p-adic field. In many cases, such as those arising from Picard-Fuchs equations or Gauss-Manin connections, this connection admits a Frobenius structure defined over a suitable rigid analytic subspace. We give an effective convergence bound for this Frobenius structure by studying the effect of changing the Frobenius lift. We also give some examples indicating that our bound is essentially optimal.

math.NT