2000 character limit reached
Hypergeometric L-functions in average polynomial time (2005.13640v4)
Published 27 May 2020 in math.NT
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.
Collections
Sign up for free to add this paper to one or more collections.