Search arXivSearch

arXiv · 2408.01643

Comparing Hecke eigenvalues for pairs of automorphic representations for GL(2)

Abstract

We consider a variant of the strong multiplicity one theorem. Let $π_{1}$ and $π_{2}$ be two unitary cuspidal automorphic representations for $\mathrm{GL(2)}$ that are not twist-equivalent. We find a lower bound for the lower Dirichlet density of the set of places for which $\left\lvert a_{v}(π_{1}) \right\rvert > \left\lvert a_{v}(π_{2}) \right\rvert$, where $a_{v}(π_{i})$ is the trace of Langlands conjugacy class of $π_{i}$ at $v$. One consequence of this result is an improvement on the existing bound on the lower Dirichlet density of the set of places for which $\left\lvert a_{v}(π_{1})\right\rvert \neq \left\lvert a_{v}(π_{2}) \right\rvert$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kin Ming Tsang. 2026-04-14. Comparing Hecke eigenvalues for pairs of automorphic representations for GL(2). https://doi.org/10.1016/j.jnt.2025.09.012

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