English

Computing modular Galois representations for small $\ell$

Number Theory 2017-07-24 v1

Abstract

In this paper we describe an algorithm for computing mod \ell Galois representations associated to modular forms of weight kk when <k1\ell <k-1. As applications, we use this algorithm to explicitly compute the cases with Δk\Delta_{k} for k=16,20,22,26k=16,20, 22, 26 and all the unexceptional primes \ell with <k1\ell <k-1.

Keywords

Cite

@article{arxiv.1707.06736,
  title  = {Computing modular Galois representations for small $\ell$},
  author = {Peng Tian},
  journal= {arXiv preprint arXiv:1707.06736},
  year   = {2017}
}
R2 v1 2026-06-22T20:53:31.876Z