Search arXivSearch

arXiv · 2207.06198

On Fourier coefficients and Hecke eigenvalues of Siegel cusp forms of degree 2

Abstract

We investigate some key analytic properties of Fourier coefficients and Hecke eigenvalues attached to scalar-valued Siegel cusp forms $F$ of degree 2, weight $k$ and level $N$. First, assuming that $F$ is a Hecke eigenform that is not of Saito-Kurokawa type, we prove an improved bound in the $k$-aspect for the smallest prime at which its Hecke eigenvalue is negative. Secondly, we show that there are infinitely many sign changes among the Hecke eigenvalues of $F$ at primes lying in an arithmetic progression. Third, we show that there are infinitely many positive as well as infinitely many negative Fourier coefficients in any ``radial" sequence comprising of prime multiples of a fixed fundamental matrix. Finally we consider the case when $F$ is of Saito--Kurokawa type, and in this case we prove the (essentially sharp) bound $| a(T) | ~\ll_{F, ε}~ \big( \det T \big)^{\frac{k-1}{2}+ε}$ for the Fourier coefficients of $F$ whenever $\gcd(4 \det(T), N)$ is squarefree, confirming a conjecture made (in the case $N=1$) by Das and Kohnen.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Biplab Paul, Abhishek Saha. 2022-10-31. On Fourier coefficients and Hecke eigenvalues of Siegel cusp forms of degree 2. https://arxiv.org/abs/2207.06198

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