Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.12609

Relative Trace Formula And Simultaneous Nonvanishing for GL_3 x GL_2 and GL_3 x GL_1 L-functions

Philippe Michel·Dinakar Ramakrishnan·Liyang Yang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Fix a Dirichlet character $χ$ and a cuspidal GL$(2)$ eigenform $ϕ$ with relatively prime conductors. Then we show that there are infinitely many cusp forms $π$ on GL$(3)$ such that $L(1/2, π\times χ)$ and $L(1/2, π\times ϕ)$ are simultaneously non-zero. We achieve this by use of Jacquet's Relative Trace Formula. We derive an expression of the average over the GL$(3)$ cuspidal spectrum as a sum of a non-zero main term and two subsidiary terms which are forced to be zero for large enough level by use of a suitable test function. This modest article is dedicated to the memory of Harish Chandra, on the occasion of his hundredth birthday.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philippe Michel, Dinakar Ramakrishnan, Liyang Yang. 2024-11-19. Relative Trace Formula And Simultaneous Nonvanishing for GL_3 x GL_2 and GL_3 x GL_1 L-functions. https://arxiv.org/abs/2411.12609

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗