arXiv · 1707.06736
Computing modular Galois representations for small $\ell$
Abstract
In this paper we describe an algorithm for computing mod $\ell$ Galois representations associated to modular forms of weight $k$ when $\ell <k-1$. As applications, we use this algorithm to explicitly compute the cases with $\Delta_{k}$ for $k=16,20, 22, 26$ and all the unexceptional primes $\ell$ with $\ell <k-1$.
Explore related subjects
Keep this discovery
Peng Tian. 2017-07-21. Computing modular Galois representations for small $\ell$. https://arxiv.org/abs/1707.06736
Cite the original work for its findings. Save a collection to share your selection of sources.