Search arXivSearch

arXiv · 2505.04973

Prime scattering geodesic theorem

Abstract

The modular surface, given by the quotient $\mathcal{M} = \Ha/\text{PSL}(2,\Z)$, can be partitioned into a compact subset $\Mm$ and an open neighborhood of the unique cusp in $\mathcal{M}$. We consider scattering geodesics in $\mathcal{M}$, first introduced by Victor Guillemin in \cite{Guillemin1976-xr} for hyperbolic surfaces with cusps. These are geodesics in $\mathcal{M}$ that lie in $\mathcal{M} \setminus \Mm$ for both large positive and negative times. Associated with such a scattering geodesic in $\mathcal{M}$, a finite \textit{sojourn time} is defined in \cite{Guillemin1976-xr}. In this article, we study the distribution of these scattering geodesics in $\mathcal{M}$ and their associated \textit{sojourn times}. In this process, we establish a connection between the counting of scattering geodesics on the modular surface and the study of positive integers whose prime divisors lie in arithmetic progression. This article is the first such result for scattering geodesics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sudhir Pujahari, Punya Plaban Satpathy. 2025-05-08. Prime scattering geodesic theorem. https://arxiv.org/abs/2505.04973

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