Hypergeometric L-functions in average polynomial time, II

2023/10/10 by Edgar Costa, Costa, Edgar, Kiran S. Kedlaya +3
Computer Science · Mathematics · #11M38 #11T24 (secondary) #11Y16 #33C20 (primary) #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Commutative Algebra and Its Applications #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation #and 11G09

paper · pdf · doi:10.48550/arxiv.2310.06971

openalex publication_date 2023/10/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For a fixed positive integer e, we describe an algorithm for computing, for all primes p ≤ X, the mod-p^e reduction of the trace of Frobenius at p of a fixed hypergeometric motive over ℚ in time quasilinear in X. This extends our previous work for the mod-p reduction, again combining the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey and Harvey--Sutherland; the key new ingredient 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 computing hypergeometric L-series.

Related

• Hypergeometric L-functions in average polynomial time
• An algorithm of computing special values of Dwork's p-adic hypergeometric functions in polynomial time
• p-Adic hypergeometric functions and the trace of Frobenius of elliptic curves
• Hypergeometric functions over F_p and relations to elliptic curves and modular forms
• Hypergeometric functions over mathbbF_q and traces of Frobenius for\n elliptic curves