Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2310.06971 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914816095944704 |
|---|---|
| author | Costa, Edgar Kedlaya, Kiran S. Roe, David |
| author_facet | Costa, Edgar Kedlaya, Kiran S. Roe, David |
| contents | For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_06971 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Hypergeometric $L$-functions in average polynomial time, II Costa, Edgar Kedlaya, Kiran S. Roe, David Number Theory Algebraic Geometry 11Y16, 33C20 (primary), and 11G09, 11M38, 11T24 (secondary) For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ 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. |
| title | Hypergeometric $L$-functions in average polynomial time, II |
| topic | Number Theory Algebraic Geometry 11Y16, 33C20 (primary), and 11G09, 11M38, 11T24 (secondary) |
| url | https://arxiv.org/abs/2310.06971 |