Search arXivSearch

arXiv · 1611.02668

Computing the Laplace eigenvalue and level of Maass cusp forms

Abstract

Let $f$ be a primitive Maass cusp form for a congruence subgroup $Γ_0(D) \subset $ SL($2,\mathbb{Z}$) and $λ_f(n)$ its $n$-th Fourier coefficient. In this paper it is shown that with knowledge of only finitely many $λ_f(n)$ one can often solve for the level $D$, and in some cases, estimate the Laplace eigenvalue to arbitrarily high precision. This is done by analyzing the resonance and rapid decay of smoothly weighted sums of $λ_f(n)e(αn^β)$ for $X \leq n \leq 2X$ and any choice of $α\in \mathbb{R}$, and $β>0$. The methods include the Voronoi summation formula, asymptotic expansions of Bessel functions, weighted stationary phase, and computational software. These algorithms manifest the belief that the resonance and rapid decay nature uniquely characterizes the underlying cusp form. They also demonstrate that the Fourier coefficients of a cusp form contain all arithmetic information of the form.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Savala. 2016-11-08. Computing the Laplace eigenvalue and level of Maass cusp forms. https://doi.org/10.1016/j.jnt.2016.09.015

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