Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1303.0889

Weighted Sato-Tate Vertical Distribution of the Satake Parameter of Maass Forms on PGL(N)

Fan Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

We formulate a conjectured orthogonality relation between the Fourier coefficients of Maass forms on PGL(N) for N>=2. Based on the work of Goldfeld-Kontorovich and Blomer for N=3, and on our conjecture for N>=4, we prove a weighted vertical equidistribution theorem (with respect to the generalized Sato-Tate measure) for the Satake parameter of Maass forms at a finite prime. For N=3, the rate of convergence for the equidistribution theorem is obtained.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fan Zhou. 2013-08-01. Weighted Sato-Tate Vertical Distribution of the Satake Parameter of Maass Forms on PGL(N). https://doi.org/10.1007/s11139-013-9535-6

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↗