Computing modular Galois representations for small $\ell$
Number Theory
2017-07-24 v1
Abstract
In this paper we describe an algorithm for computing mod Galois representations associated to modular forms of weight when . As applications, we use this algorithm to explicitly compute the cases with for and all the unexceptional primes with .
Cite
@article{arxiv.1707.06736,
title = {Computing modular Galois representations for small $\ell$},
author = {Peng Tian},
journal= {arXiv preprint arXiv:1707.06736},
year = {2017}
}