2008
DOI: 10.1016/j.jnt.2008.02.008
|View full text |Cite
|
Sign up to set email alerts
|

Hecke operators on Drinfeld cusp forms

Abstract: In this paper, we study the Drinfeld cusp forms for Γ 1 (T ) and Γ (T ) using Teitelbaum's interpretation as harmonic cocycles. We obtain explicit eigenvalues of Hecke operators associated to degree one prime ideals acting on the cusp forms for Γ 1 (T ) of small weights and conclude that these Hecke operators are simultaneously diagonalizable. We also show that the Hecke operators are not diagonalizable in general for Γ 1 (T ) of large weights, and not for Γ (T ) even of small weights. The Hecke eigenvalues on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
18
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(20 citation statements)
references
References 6 publications
2
18
0
Order By: Relevance
“…Warning. To shorten some notations and simplify some exponents we normalize Hecke operators multiplying by the factor t k−m (as in [21]): this will erase any reference to the type m in the final formulas. Moreover the slope for newforms will transform into k 2 (from the previous m − k 2 ).…”
Section: Fricke Involution and Trace Mapsmentioning
confidence: 99%
See 3 more Smart Citations
“…Warning. To shorten some notations and simplify some exponents we normalize Hecke operators multiplying by the factor t k−m (as in [21]): this will erase any reference to the type m in the final formulas. Moreover the slope for newforms will transform into k 2 (from the previous m − k 2 ).…”
Section: Fricke Involution and Trace Mapsmentioning
confidence: 99%
“…To check the diagonalizability of the operator U t , we fix the same basis used in [21]. Recall that by [13, Corollary 5.7] we have g(Γ 1 (t)) = 0 and, applying Theorem 2.2, we obtain…”
Section: Action Of U T On a Particular Basismentioning
confidence: 99%
See 2 more Smart Citations
“…. , i s ) run over the set of (s + 1)-tuples (s arbitrary) satisfying i 0 + · · · + i s = m, i 0 + i 1 q + · · · + i s q s = n. According to [3, (3.8)] formula (7) shows that [12] shows that for 1 ≤ j ≤ q:…”
Section: Notationmentioning
confidence: 99%