Search arXivSearch

arXiv · 2608.05853

Generalised Gauss--Kuzmin Distribution for Klein sails in $\mathbb R^3$

Abstract

The classical Gauss--Kuzmin distribution describes the asymptotic distribution of continued fraction digits. Geometrically, this may be interpreted as the equidistribution of faces of Klein sails in $\mathbb R^2$. In this paper, we establish a three-dimensional analogue of this phenomenon. We prove the equidistribution of local face structures in generic Klein sails in $\mathbb R^3$, thereby obtaining a higher-dimensional generalization of the Gauss--Kuzmin distribution. In addition, we resolve several open questions posed by Karpenkov~\cite{Ka17}. Our approach is based on homogeneous dynamics and is motivated from the work of Kontsevich and Suhov~\cite{KS99}. More precisely, we construct a cross-section for the diagonal flow on $\operatorname{SL}_3(\mathbb R)/\operatorname{SL}_3(\mathbb Z)$, such that visits to the cross-section encode the geometry of three-dimensional sails. The principal technical contribution is the proof that the associated cross-sectional measure is finite, which enables us to derive the limiting face statistics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gaurav Aggarwal, Konstantin Andritsch. 2026-08-06. Generalised Gauss--Kuzmin Distribution for Klein sails in $\mathbb R^3$. https://arxiv.org/abs/2608.05853

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