arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.13640math.NT
收藏

Hypergeometric L-functions in average polynomial time

Edgar Costa, Kiran S. Kedlaya, David Roe

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑