Search arXivSearch

arXiv · 2411.12754

Formes modulaires modulo $2$ : L'ordre de nilpotence des opérateurs de Hecke (version développée)

Abstract

Let $Δ= \sum_{m=0}^\infty q^{(2m+1)^2} \in \mathbb{F}_2[[q]]$ be the reduction mod 2 of the $Δ$ series. A modular form $f$ modulo $2$ of level 1 is a polynomial in $Δ$. If $p$ is an odd prime, then the Hecke operator $T_p$ transforms $f$ in a modular form $T_p(f)$ which is a polynomial in $Δ$ whose degree is smaller than the degree of $f$, so that $T_p$ is nilpotent. The order of nilpotence of $f$ is defined as the smallest integer $g=g(f)$ such that, for every family of $g$ odd primes $p_1,p_2,\ldots,p_g$, the relation $T_{p_1}T_{p_2}\ldots T_{p_g}(f)=0$ holds. We show how one can compute explicitly $g(f)$; if $f$ is a polynomial of degree $d\geqslant 1$ in $Δ$, one finds that $g(f) < \frac 32 \sqrt d$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Louis Nicolas. 2024-11-07. Formes modulaires modulo $2$ : L'ordre de nilpotence des opérateurs de Hecke (version développée). https://arxiv.org/abs/2411.12754

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT