Papers › Hypergeometric L-functions in average polynomial time, II
Hypergeometric L-functions in average polynomial time, II
Edgar Costa, Kiran S. Kedlaya, David Roe
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
For a fixed positive integer e, we describe an algorithm for computing, for all primes p ≤X, the mod-pᵉ reduction of the trace of Frobenius at p of a fixed hypergeometric motive over ℚ in time quasilinear in X. This extends our previous work for the mod-p reduction, again combining the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey and Harvey--Sutherland; the key new ingredient is an expanded version of Harvey's "generic prime" construction, making it possible to incorporate certain p-adic transcendental functions into the computation. One of these is the p-adic Gamma function, whose average polynomial time computation is an intermediate step which may be of independent interest. We also provide an implementation in Sage and discuss the remaining computational issues around computing hypergeometric L-series.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections