MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The question is strongly focused on computations concerning modular forms and Hecke algebras. It is already in the title, but I will repeat it, adding a few details.

Let $S_k$ be the complex vector space of classical, holomorphic cusp forms of weight $k$ and level one, and let $\mathbf{T}_k^0$ be the subring of the endomorphisms ring of $S_k$ generated, over $\mathbf{Z}$, by all the Hecke operators $T_\ell$. It is well known that $\mathbf{T}_k^0$ is finite free as $\mathbf{Z}$-module, and that $\mathbf{T}_k^0\otimes\mathbf{Q}$ is isomorphic to a product of finitely many number fields $K_i$. This is to say that $\mathbf{T}_k^0$ is isomorphic to a finite index subring of the product of the rings of integers $\mathcal{O}_i$'s of the $K_i$'s. Let this index be $d_k$.

I would like to know if there are examples of weights $k$ so that $d_k$ is divisible by a prime $p$ with $p\geq k-1$ (which is to say, the perhaps more familiar, $k\leq p+1$).

While performing computations with SAGE, I was not able to find any example of a pair $(p,k)$, with $k\leq p+1$, and $p<1600$, so that $p$ divides $d_k$.


[The motivation for asking this question is the study of $\overline{\mathbf{F}}_p$-valued points of the spectrum of $\mathbf{T}_k^0$,

that parametrize certain two-dimensional mod $p$ representations of $G_\mathbf{Q}$. One reason for which the cardinality of $\mathbf{Spec}(\mathbf{T}_k^0)(\overline{\mathbf{F}}_p)$ might turned out to be strictly smaller than $\mathbf{Spec}(\mathbf{T}_k^0)(\mathbf{C})$ is that $p$ divide the index $d_k$, in the notation above.]

share|cite|improve this question
By the way, if you edit your post any more times, it is going to automatically become community wiki (it is an annoying "feature" of the software). – Harry Gindi Apr 14 '10 at 15:08

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.