Related papers: Dynamical properties of simplicial systems and con…
Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map $$ (x_1,x_2) \in \mathbb{R}_+^2 \longmapsto \left\{\begin{array}{ll} (x_1 - x_2, x_2), & \mbox{if $x_1…
The Arnoux-Rauzy-Poincar\'e multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincar\'e algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in…
The two-dimensional homogeneous Euclidean algorithm is the central motivation for the definition of the classical multidimensional continued fraction algorithms, as Jacobi-Perron, Poincar\'e, Brun and Selmer algorithms. The Rauzy induction,…
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties.…
In this paper we develop a general ergodic approach which reveals the underpinnings of the effect of arithmetic operations involving normal and deterministic numbers. This allows us to recast in new light and amplify the result of Rauzy,…
We investigate the dynamics of continued fractions and explore the ergodic behaviour of the products of mixed partial quotients in continued fractions of real numbers. For any function $\Phi:\mathbb N\to [2,+\infty)$ and any integer $d\geq…
This paper studies geometric and spectral properties of $S$-adic shifts and their relation to continued fraction algorithms. These shifts are symbolic dynamical systems obtained by iterating infinitely many substitutions. Pure discrete…
We examine a pair of dynamical systems on the plane induced by a pair of spanning trees in the Cayley graph of the Super-Apollonian group of Graham, Lagarias, Mallows, Wilks and Yan. The dynamical systems compute Gaussian rational…
We prove a suite of dynamical results, including exactness of the transformation and piecewise-analyticity of the invariant measure, for a family of continued fraction systems, including specific examples over reals, complex numbers,…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely…
We study a class of interval translation mappings introduced by Bruin and Troubetzkoy, describing a new renormalization scheme, inspired by the classical Rauzy induction for this class. We construct a measure, invariant under the…
The Rauzy gasket is the attractor of a parabolic, nonconformal iterated function system on the projective plane which describes an exceptional parameter set in various important topological and dynamical problems. Since 2009 there have been…
Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example (the Rauzy dynamics) concerns an action on permutations, associated to interval exchange transformations (IET) for the…
To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…
From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes.…
In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We numerically study the two-dimensional, area preserving, web map. When the map is governed by ergodic behavior, it is, as expected, correctly described by Boltzmann-Gibbs statistics, based on the additive entropic functional $S_{BG}[p(x)]…
In this paper, a simple case of Bayesian mechanics under the free energy principle is formulated in axiomatic terms. We argue that any dynamical system with constraints on its dynamics necessarily looks as though it is performing inference…