Hypergeometric L-functions in average polynomial time, II

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...

Full description

Bibliographic Details

Published in:	Research in number theory Vol. 11; no. 1
Main Authors:	Costa, Edgar, Kedlaya, Kiran S., Roe, David
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.03.2025
Subjects:	Mathematics Mathematics and Statistics Number Theory Average polynomial time algorithms Secondary 11G09 functions Hypergeometric motives 33C20 Primary 11Y16 11M38 11T24
ISSN:	2522-0160, 2363-9555
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!