Frobenius lifts and point counting for smooth curves

Amnon Besser, François-Renaud Escriva, Rob de Jeu

Research output: Working paper/PreprintPreprint

23 Downloads (Pure)

Abstract

We describe an algorithm to compute the zeta-function of a proper, smooth curve over a finite field, when the curve is given together with some auxiliary data. Our method is based on computing the matrix of the action of a semi-linear Frobenius on the first cohomology group of the curve by means of Serre duality. The cup product involved can be computed locally, after first computing local expansions of a globally defined lift of Frobenius. The resulting algorithm's complexity is softly cubic in the field degree, which is also the case with Kedlaya's algorithm in the hyperelliptic case.
Original languageEnglish GB
StatePublished - 21 Jun 2013

Publication series

NamearXiv preprint arXiv:1903.05382

Keywords

  • math.AG
  • math.NT
  • 14F30, 14G10, 14G15, 14Q50 (Primary) 14G22 (Secondary)

Fingerprint

Dive into the research topics of 'Frobenius lifts and point counting for smooth curves'. Together they form a unique fingerprint.

Cite this