Search arXivSearch

arXiv · 2601.17524

Hecke operators, Hecke Eigensystems, and Formal Modular Forms over Number Fields

Abstract

We develop an explicit theory of formal modular forms over arbitrary number fields $K$, as functions of modular points. We define modular points for $Γ_0({\mathfrak n})$ and $Γ_1({\mathfrak n})$, where the level ${\mathfrak n}$ is an integral ideal of $K$; Hecke operators and generalized Atkin-Lehner operators as functions of modular points; and associated Hecke eigensystems. We show how complete eigensystems may be recovered, uniquely up to unramified quadratic twist, from their restrictions to principal Hecke operators, and we give explicit formulas for principal operators suitable for machine computation. These have been implemented by the author in the case of imaginary quadratic fields, and used in his systematic computation of Bianchi cusp forms, which are available in the L-functions and modular forms database (LMFDB). While our description incorporates the classical theory for $K={\mathbb Q}$, and also extends work of the author and his students for imaginary quadratic fields, it applies to arbitrary number fields, and may be useful in the computation of spaces of automorphic forms for GL$(2,K)$ over number fields, whether via modular symbols or other methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. E. Cremona. 2026-01-24. Hecke operators, Hecke Eigensystems, and Formal Modular Forms over Number Fields. https://arxiv.org/abs/2601.17524

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