2019
DOI: 10.2140/obs.2019.2.85
|View full text |Cite
|
Sign up to set email alerts
|

Explicit Coleman integration in larger characteristic

Abstract: We describe a more efficient algorithm to compute p-adic Coleman integrals on odd degree hyperelliptic curves for large primes p. The improvements come from using fast linear recurrence techniques when reducing differentials in Monsky-Washnitzer cohomology, a technique introduced by Harvey [Har07] when computing zeta functions. The complexity of our algorithm is quasilinear in √ p and is polynomial in the genus and precision. We provide timings comparing our implementation with existing approaches.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…From knowledge of M ij , f i , and the action of φ on points R and S, one is able to solve for R S ω i . We note that Best [Bes19] has improved the complexity of the integration algorithms introduced in [BBK10].…”
Section: Hyperelliptic Curvesmentioning
confidence: 99%
“…From knowledge of M ij , f i , and the action of φ on points R and S, one is able to solve for R S ω i . We note that Best [Bes19] has improved the complexity of the integration algorithms introduced in [BBK10].…”
Section: Hyperelliptic Curvesmentioning
confidence: 99%