MASCOT, Nicolas

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

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

Langue

Document de travail - Pré-publication

Résumé en anglais

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.< Réduire

Mots clés en anglais

Galois representations

modular forms

algorithmic

Galois theory

URI

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

Projet Européen

Algorithmic Number Theory in Computer Science

Origine

Importé de hal

Unités de recherche

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