Hypergeometric L-functions in average polynomial time

2020/05/27 by Costa, Edgar, Kedlaya, Kiran S., Roe, David · 1 citation
#11M38 #11T24 (secondary) #11Y16 #33C20 (primary) #FOS: Mathematics #Number Theory (math.NT) #and 11G09

paper · doi:10.48550/arxiv.2005.13640

Abstract

We describe an algorithm for computing, for all primes p ≤ 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.

Cited by

• Hypergeometric Motives from Toric Hypersurfaces

Related

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