Search arXivSearch

arXiv · 2504.02350

Inducing contractions of the mother of all continued fractions

Abstract

We introduce a new, large class of continued fraction algorithms producing what are called contracted Farey expansions. These algorithms are defined by coupling two acceleration techniques -- induced transformations and contraction -- in the setting of Shunji Ito's natural extension of the Farey tent map, which generates `slow' continued fraction expansions. In addition to defining new algorithms, we also realise several existing continued fraction algorithms in our unifying setting. In particular, we find regular continued fractions, the second-named author's $S$-expansions, and Nakada's parameterised family of $α$-continued fractions for all $0<α\le 1$ as examples of contracted Farey expansions. Moreover, we give a new description of a planar natural extension for each of the $α$-continued fraction transformations as an explicit induced transformation of Ito's natural extension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karma Dajani, Cor Kraaikamp, Slade Sanderson. 2025-04-03. Inducing contractions of the mother of all continued fractions. https://arxiv.org/abs/2504.02350

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