The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We propose an improved algorithm for computing mod ℓ Galois representations associated to a cusp form f of level one. The proposed method allows us to explicitly compute the case with ℓ = 29 and f of weight k = 16, and the cases with ℓ = 31 and f of weight k = 12,20,22. All the results are rigorously proved to be correct.
As an example, we will compute the values modulo 31 of Ramanujan's tau function at some huge primes up to a sign. Also we will give an improved uper bound on...
Download Results (CSV)