Search arXivSearch

arXiv · 2111.02297

Spectral reciprocity for $\mathrm{GL}(n)$ and simultaneous non-vanishing of central $L$-values

Abstract

Let $F$ be a totally real number field and $n\ge 3$. Let $Π$ and $π$ be cuspidal automorphic representations for $\mathrm{PGL}_{n+1}(F)$ and $\mathrm{PGL}_{n-1}(F)$, respectively, that are unramified and tempered at all finite places. We prove simultaneous non-vanishing of the Rankin--Selberg $L$-values $L(1/2,Π\otimes\widetildeσ)$ and $L(1/2,σ\otimes\widetildeπ)$ for certain sequences of $σ$ varying over cuspidal automorphic representations for $\mathrm{PGL}_n(F)$ with conductor tending to infinity in the level aspect and bearing certain local conditions. Along the way, we also prove a reciprocity formula for the average of the product of Rankin--Selberg $L$-functions $L(1/2,Π\otimes\widetildeσ)L(1/2,σ\otimes\widetildeπ)$ over a conductor aspect family of $σ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Subhajit Jana, Ramon Nunes. 2024-11-13. Spectral reciprocity for $\mathrm{GL}(n)$ and simultaneous non-vanishing of central $L$-values. https://doi.org/10.1353/ajm.2026.a980773

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