Search arXivSearch

arXiv · 2205.15382

Algebraicity of ratios of Rankin-Selberg $L$-functions and applications to Deligne's conjecture

Abstract

In this paper, we prove Deligne's conjecture on the algebraicity of the critical values of symmetric power $L$-functions associated with modular forms of weight at least 5. We also establish new cases of Blasius' conjecture on the algebraicity of the critical values of tensor product $L$-functions associated with modular forms. Additionally, we prove an algebraicity result for the critical values of Rankin--Selberg $L$-functions for $\GL_n \times \GL_2$ in the unbalanced case, which extends the previous results of Furusawa and Morimoto for ${\rm SO}(V) \times \GL_2$. These results are applications of our main theorem on the algebraicity of cross ratios of Rankin--Selberg $L$-functions at critical points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shih-Yu Chen. 2026-06-09. Algebraicity of ratios of Rankin-Selberg $L$-functions and applications to Deligne's conjecture. https://arxiv.org/abs/2205.15382

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