pith. sign in

arxiv: 1707.06736 · v1 · pith:CG2H5A2Inew · submitted 2017-07-21 · 🧮 math.NT

Computing modular Galois representations for small ell

classification 🧮 math.NT
keywords algorithmcomputinggaloismodularrepresentationsapplicationsassociatedcases
0
0 comments X
read the original 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.