Hypergeometric L-functions in average polynomial time
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:I2SH3IQKrecord.jsonopen to challenge →
classification
math.NT
keywords
timeaveragehypergeometricpolynomialtracealgorithmbeukers--cohen--mellitcombines
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.