MASCOT, Nicolas

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

MASCOT, Nicolas
Lithe and fast algorithmic number theory [LFANT]

Idioma

Document de travail - Pré-publication

Resumen en inglés

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

Palabras clave en inglés

Galois representations

modular forms

algorithmic

Galois theory

URI

https://oskar-bordeaux.fr/handle/20.500.12278/194479

Proyecto europeo

Algorithmic Number Theory in Computer Science

Orígen

Importado de Hal

Centros de investigación

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251