Search arXivSearch

arXiv · 1411.6022

Resonance and rapid decay of exponential sums of Fourier coefficients of a Maass form for $GL_m(\mathbb Z)$

Abstract

Let $f$ be a full-level cusp form for $GL_m(\mathbb Z)$ with Fourier coefficients $A_f(n_1,...,n_{m-1})$. In this paper an asymptotic expansion of Voronoi's summation formula for $f$ is established. As applications of this formula, a smoothly weighted average of $A_f(n,1,...,1)$ against $e(α|n|^β)$ is proved to be rapidly decayed when $0<β<1/m$. When $β=1/m$ and $α$ equals or approaches $\pm mq^{1/m}$ for a positive integer $q$, this smooth average has a main term of the size of $|A_f(1,...,1,q)+A_f(1,...,1,-q)|X^{1/(2m)+1/2}$, which is a manifestation of resonance of oscillation exhibited by the Fourier coefficients $A_f(n,1,...,1)$. Similar estimate is also proved for a sharp-cut sum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiumin Ren, Yangbo Ye. 2014-11-21. Resonance and rapid decay of exponential sums of Fourier coefficients of a Maass form for $GL_m(\mathbb Z)$. https://doi.org/10.1007/s11425-014-4955-3

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