arXiv · 2005.13640
Hypergeometric L-functions in average polynomial time
Abstract
We describe an algorithm for computing, for all primes $p \leq X$, the mod-$p$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive in time quasilinear in $X$. This combines the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey et al.
Explore related subjects
Keep this discovery
Edgar Costa, Kiran S. Kedlaya, David Roe. 2020-05-27. Hypergeometric L-functions in average polynomial time. https://arxiv.org/abs/2005.13640
Cite the original work for its findings. Save a collection to share your selection of sources.