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

Celý popis

Podrobná bibliografia

Vydané v:	Research in number theory Ročník 11; číslo 1
Hlavní autori:	Costa, Edgar, Kedlaya, Kiran S., Roe, David
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.03.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!