Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.04389

Special periods and some non-tempered cases of the Gan-Gross-Prasad conjecture

Jaeho Haan·Sanghoon Kwon
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we establish a relationship between special periods and special L-values of automorphic representations of classical groups, and prove the non-tempered global Gan--Gross--Prasad conjecture in several cases. Our approach consists of two main steps. First, inspired by Rallis' tower property, we study the interaction between special periods and the tower property for the genericity of global theta lifts. Second, we investigate the relationship between the analytic properties of L-functions and special periods via the Rankin--Selberg integral method. Combining these results with non-vanishing criteria for global theta lifts in terms of various L-values, we prove three explicit higher-corank families of non-tempered cases of the global Gan--Gross--Prasad conjecture.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaeho Haan, Sanghoon Kwon. 2026-07-30. Special periods and some non-tempered cases of the Gan-Gross-Prasad conjecture. https://arxiv.org/abs/2605.04389

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↗