Using the natural extensions for the Rosen maps, we give an infinite-order-chain representation of the sequence of the incomplete quotients of the Rosen fractions. Together with the ergodic behaviour of a certain homogeneous random system with complete connections, this allows us to solve a variant of Gauss-Kuzmin problem for the above fraction expansion.
In this paper the Engel continued fraction (ECF) expansion of any is introduced. Basic and ergodic properties of this expansion are studied. Also the relation between the ECF and F. Ryde’s monotonen, nicht-abnehmenden Kettenbruch (MNK) is studied.
We show that the set of numbers with bounded Lüroth expansions (or bounded Lüroth series) is winning and strong winning. From either winning property, it immediately follows that the set is dense, has full Hausdorff dimension, and satisfies a countable intersection property. Our result matches the well-known analogous result for bounded continued fraction expansions or, equivalently, badly approximable numbers. We note that Lüroth expansions have a countably infinite Markov partition,...
For every irrational rotation we construct a coboundary which is continuous except at a single point where it has a jump, is nondecreasing, and has zero derivative almost everywhere.
We define a class of step cocycles (which are coboundaries) for irrational rotations of the unit circle and give conditions for their approximation by smooth and real analytic coboundaries. The transfer functions of the approximating (smooth and real analytic) coboundaries are close (in the supremum norm) to the transfer functions of the original ones. This result makes it possible to construct smooth and real analytic cocycles which are ergodic, ergodic and squashable (see [Aaronson, Lemańczyk,...
We obtain new results regarding the precise average-case analysis of the main quantities that intervene in algorithms of a broad Euclidean type. We develop a general framework for the analysis of such algorithms, where the average-case complexity of an algorithm is related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The methods rely on properties of transfer operators suitably adapted from dynamical systems theory and provide...
Introduction. Soit θ un élément de ¹=ℝ/ℤ. Considérons la suite des multiples de θ, . Pour tout n ∈ ℕ, ordonnons les n+1 premiers termes de cette suite, 0 = y₀ ≤ y₁ ≤...≤ yₙ ≤ 1 = pθ, p=0,...,n. La suite (y₀,...,yₙ) découpe l’intervalle [0,1] en n+1 intervalles qui ont au plus trois longueurs distinctes, la plus grande de ces longueurs étant la somme des deux autres. Cette propriété a été conjecturé par Steinhaus, elle est étroitement liée au développement en fraction continue de θ. On peut aussi...
On montre que les exposants de Lyapunov de l’algorithme de Jacobi-Perron, en dimension quelconque, sont tous différents et que la somme des exposants extrêmes est strictement positive. En particulier, si , le deuxième exposant est strictement négatif.
Nous proposons de formaliser une méthode d’approximation diophantienne dans en considérant l’action de sur le demi-plan complexe. On retrouvera le thème classique de la connexion entre développement en fractions continues et flots géodésiques modélisé ici par un billard hyperbolique.