Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1011.1291

Mass equidistribution of Hilbert modular eigenforms

Paul D. Nelson
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let F be a totally real number field, and let f traverse a sequence of non-dihedral holomorphic eigencuspforms on GL(2)/F of weight (k_1,...,k_n), trivial central character and full level. We show that the mass of f equidistributes on the Hilbert modular variety as max(k_1,...,k_n) tends to infinity. Our result answers affirmatively a natural analogue of a conjecture of Rudnick and Sarnak (1994). Our proof generalizes the argument of Holowinsky-Soundararajan (2008) who established the case F = Q. The essential difficulty in doing so is to adapt Holowinsky's bounds for the Weyl periods of the equidistribution problem in terms of manageable shifted convolution sums of Fourier coefficients to the case of a number field with nontrivial unit group.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul D. Nelson. 2012-02-28. Mass equidistribution of Hilbert modular eigenforms. https://doi.org/10.1007/s11139-011-9319-9

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗