Hypergeometric L-functions in average polynomial time, II
Name
40993_2024_Article_593.pdf
Size
475.08 KB
Format
Adobe PDF
Checksum (MD5)
c92de6f2dd35b2b644f65c40523bb2f3
Author(s)
Costa, Edgar
Kedlaya, Kiran S.
Roe, David
Date Issued
January 30, 2025
Journal
Research in Number Theory
Publisher
Springer International Publishing
Citation
Costa, E., Kedlaya, K.S. & Roe, D. Hypergeometric L-functions in average polynomial time, II. Res. number theory 11, 32 (2025).
Version
Final published version
Abstract
We describe an algorithm for computing, for all primes p ≤ X , the trace of Frobenius at p of a hypergeometric motive over Q in time quasilinear in X. This involves computing the trace modulo p e for suitable e; as in our previous work treating the case e = 1 , we combine the Beukers–Cohen–Mellit trace formula with average polynomial time techniques of Harvey and Harvey–Sutherland. The key new ingredient for e > 1 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 tabulating hypergeometric L-series.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s40993-024-00593-8
