Hypergeometric L-functions in average polynomial time
Number Theory
2020-09-22 v4
Abstract
We describe an algorithm for computing, for all primes , the mod- reduction of the trace of Frobenius at of a fixed hypergeometric motive in time quasilinear in . This combines the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey et al.
Keywords
Cite
@article{arxiv.2005.13640,
title = {Hypergeometric L-functions in average polynomial time},
author = {Edgar Costa and Kiran S. Kedlaya and David Roe},
journal= {arXiv preprint arXiv:2005.13640},
year = {2020}
}
Comments
15 pages, 1 figure; v4 several exposition improvements as suggested the referees