加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本