About the choice of a basis in Kedlaya's algorithm

Details About the choice of a basis in Kedlaya's algorithm About the choice of a basis in Kedlaya's algorithm

2008-09-07

arxiv.org/abs/0809.1243v1

Mathematics

Algebraic Geometry

This is a (fully independent) chapter of the author's PhD thesis

Scientific paper

Kedlaya's algorithm (Kedlaya, J. Ramanujan Math. Soc 16, 2001) can be used to count the points of arbitrary hyperelliptic curves over finite fields of characteristic p, where p is an odd prime. The algorithm uses the cohomology of a p-adic lift of the curve. The Frobenius morphism of the curve induces an automorphism of this cohomological space. The key step of the algorithm is to determine this automorphism with a sufficiently high p-adic precision: it is given in the form of a matrix with respect to a certain basis. Edixhoven has found a basis that has the property that the coefficients of the matrix are p-adically integral. This allows a smaller required precision, because a (semi-linear) power of this matrix must be computed up to some given precision. This text describes Edixhoven's basis and provides a proof of the fact that the basis is suitable.

Affiliated with

Also associated with

No associations

Rating

About the choice of a basis in Kedlaya's algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with About the choice of a basis in Kedlaya's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and About the choice of a basis in Kedlaya's algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-322357