Mostrar el registro sencillo del ítem
Tables of modular Galois representations
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| dc.contributor.author | MASCOT, Nicolas | |
| dc.date.accessioned | 2024-04-04T03:19:09Z | |
| dc.date.available | 2024-04-04T03:19:09Z | |
| dc.date.created | 2014 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194479 | |
| dc.description.abstractEn | We give tables of modular Galois representations obtained using the algo-rithm which we described in [Mas13]. We computed Galois representations modulo primes up to 31 for the first time. In particular, we computed the representations attached to a newform with non-rational (but of course algebraic) coefficients, which had never been done before. These computations take place in the jacobian of modular curves of genus up to 26. We also show how these computation results can be partially proved. | |
| dc.language.iso | en | |
| dc.subject.en | Galois representations | |
| dc.subject.en | modular forms | |
| dc.subject.en | algorithmic | |
| dc.subject.en | Galois theory | |
| dc.title.en | Tables of modular Galois representations | |
| dc.type | Document de travail - Pré-publication | |
| dc.subject.hal | Mathématiques [math]/Théorie des nombres [math.NT] | |
| dc.identifier.arxiv | 1312.6418 | |
| dc.description.sponsorshipEurope | Algorithmic Number Theory in Computer Science | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| hal.identifier | hal-01110252 | |
| hal.version | 1 | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01110252v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=MASCOT,%20Nicolas&rft.genre=preprint |
Archivos en el ítem
| Archivos | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay archivos asociados a este ítem. |
|||