Search arXivSearch

arXiv · 2608.13232

Asymptotic Analysis and Phase Transition of the Bessel-Kuznetsov Transform with an Oscillatory Phase

Abstract

The spectral side of the Kuznetsov trace formula for $GL(2)$ is governed by the Bessel-Kuznetsov integral transform $\checkϕ(t)$. While classical bounds guarantee rapid decay of this transform for smooth, non-oscillatory test functions, modern applications in analytic number theory---particularly those involving twisted shifted convolution sums---frequently encounter test functions exhibiting a highly oscillatory linear phase $e(αx)$. In this paper, we provide a rigorous and explicit asymptotic analysis of $\checkϕ(t)$ in the semiclassical limit $t \to \infty$ under such oscillatory conditions. By applying the WKB approximation to the imaginary-order Bessel kernel, we identify a sharp phase transition dependent on the twist parameter $α$. We prove that in the sub-critical regime ($α\le 1/2π$), the transform decays rapidly. Conversely, in the super-critical regime ($α> 1/2π$), the geometric oscillations resonate with the spectral kernel, yielding a localized main term of order $O(t^{-1})$ with a remarkably simplified arithmetic phase.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuhang Shi. 2026-08-13. Asymptotic Analysis and Phase Transition of the Bessel-Kuznetsov Transform with an Oscillatory Phase. https://doi.org/10.1080/10652469.2026.2700610

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