Formes modulaires modulo $2$ : L'ordre de nilpotence des op\'erateurs de Hecke (version d\'evelopp\'ee)
Jean-Louis Nicolas

TL;DR
This paper investigates the nilpotence order of Hecke operators acting on mod 2 modular forms, providing explicit computation methods and establishing an upper bound related to the degree of the polynomial.
Contribution
It introduces a method to explicitly compute the nilpotence order of Hecke operators on mod 2 modular forms and establishes an upper bound proportional to the square root of the polynomial degree.
Findings
Explicit formula for the nilpotence order g(f)
Upper bound g(f) < 1.5 * sqrt(d) for degree d polynomials
Hecke operators are nilpotent on mod 2 modular forms
Abstract
Let be the reduction mod 2 of the series. A modular form modulo of level 1 is a polynomial in . If is an odd prime, then the Hecke operator transforms in a modular form which is a polynomial in whose degree is smaller than the degree of , so that is nilpotent. The order of nilpotence of is defined as the smallest integer such that, for every family of odd primes , the relation holds. We show how one can compute explicitly ; if is a polynomial of degree in , one finds that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory
