Search arXivSearch

arXiv · 2311.18798

A lower bound for the discrepancy in a Sato-Tate type measure

Abstract

Let $S_k(N)$ denote the space of cusp forms of even integer weight $k$ and level $N$. We prove an asymptotic for the Petersson trace formula for $S_k(N)$ under an appropriate condition. Using the non-vanishing of a Kloosterman sum involved in the asymptotic, we give a lower bound for discrepancy in the Sato-Tate distribution for levels not divisible by $8$. This generalizes a result of Jung and Sardari for squarefree levels. An analogue of the Sato-Tate distribution was obtained by Omar and Mazhouda for the distribution of eigenvalues $λ_{p^2}(f)$ where $f$ is a Hecke eigenform and $p$ is a prime number. As an application of the above-mentioned asymptotic, we obtain a sequence of weights $k_n$ such that discrepancy in the analogue distribution obtained by Omar and Mazhouda has a lower bound.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jishu Das. 2023-11-30. A lower bound for the discrepancy in a Sato-Tate type measure. https://doi.org/10.1007/s11139-024-00909-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