Search arXivSearch

arXiv · 2609.10446

On the Number of Hecke Eigenvalues of Same Sign on $\mathrm{GL}_n$

Abstract

We study the distribution of signs of the (real-valued) Hecke eigenvalues $A(m,1,...,1)$ of self-dual Hecke--Maass cusp forms for the group $\mathrm{SL}_n(\mathbb Z)$, where $n\geq 2$ is an integer. Our main result establishes, under Generalised Ramanujan--Petersson Conjecture, that for almost all $x\sim X$ the short interval $[x,x+H]$ contains a subset $\mathcal S$ (resp. $\mathcal S')$ of size $\gg H(\log X)^{1/n^2-1}$ such that $A(m,1,...,1)$ is positive (resp. negative) for all $m\in\mathcal S$ (resp. $m\in\mathcal S'$), provided that $(\log X)^{1-1/n^2}\ll H\ll X$. We also prove a slightly stronger result unconditionally for $\mathrm{GL}_2$ and $\mathrm{GL}_3$ Hecke--Maass cusp forms. In addition, we obtain results under weaker bounds towards Generalised Ramanujan--Petersson Conjecture. Finally, as a by-product of our methods, we improve earlier bounds for the number of Hecke eigenvalues of same sign also in long intervals unconditionally for $\mathrm{GL}_2$ and $\mathrm{GL}_3$ Hecke--Maass cusp forms, and under Generalised Ramanujan--Petersson Conjecture for $\mathrm{GL}_n$ forms when $n\geq 4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jesse Jääsaari. 2026-09-09. On the Number of Hecke Eigenvalues of Same Sign on $\mathrm{GL}_n$. https://arxiv.org/abs/2609.10446

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