Computing Euler factors of genus 2 curves at odd primes of almost good reduction
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909581929611264 |
|---|---|
| author | Maistret, Céline Sutherland, Andrew V. |
| author_facet | Maistret, Céline Sutherland, Andrew V. |
| contents | We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based on the theory of cluster pictures introduced by Dokchitser, Dokchitser, Maistret, and Morgan, which allows us to reduce the problem to a short, explicit computation over Z and Fp, followed by a point-counting computation on two elliptic curves over Fp, or a single elliptic curve over Fp^2. A key feature of our approach is that we avoid the need to compute a regular model for C. This allows us to efficiently compute many examples that are infeasible to handle using the algorithms currently available in computer algebra systems such as Magma and Pari/GP. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_02271 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computing Euler factors of genus 2 curves at odd primes of almost good reduction Maistret, Céline Sutherland, Andrew V. Number Theory 11G40 (Primary), 14G10, 14H45, 14Q05, 14Q25 (Secondary) We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based on the theory of cluster pictures introduced by Dokchitser, Dokchitser, Maistret, and Morgan, which allows us to reduce the problem to a short, explicit computation over Z and Fp, followed by a point-counting computation on two elliptic curves over Fp, or a single elliptic curve over Fp^2. A key feature of our approach is that we avoid the need to compute a regular model for C. This allows us to efficiently compute many examples that are infeasible to handle using the algorithms currently available in computer algebra systems such as Magma and Pari/GP. |
| title | Computing Euler factors of genus 2 curves at odd primes of almost good reduction |
| topic | Number Theory 11G40 (Primary), 14G10, 14H45, 14Q05, 14Q25 (Secondary) |
| url | https://arxiv.org/abs/2402.02271 |