Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.01367

Dynamical properties of simplicial systems and continued fraction algorithms

Charles Fougeron
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a new point of view on multidimensional continued fraction algorithms inspired by Rauzy induction. The generic behaviour of such an algorithm is described here as a random walk on a graph that we call simplicial system. These systems provide a family of examples for random walks with memory recorded by a finite dimensional vector. We introduce a general criterion on these graphs that induces ergodicity together with a bundle of many other dynamical properties. In particular, after computing the representation of Brun, Selmer and Arnoux-Rauzy-Poincare algorithm in this formalism, it provides a unified proof of ergodicity for these classical examples as well as new results such as uniqueness of the measure of maximal entropy on a canonical suspension. These objects also bring a new perspective to some fractal sets such as Rauzy gaskets. We show general explicit upper bound on Hausdorff dimensions of fractals described in this formalism as well as a construction of their measure of maximal entropy. This implies in particular that the Rauzy gasket in all dimensions has Hausdorff dimension strictly smaller than its ambient space, as well as sharper bounds on the dimension and an asymptotic result.

Explore related subjects

math.DSmath.COmath.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Charles Fougeron. 2020-11-16. Dynamical properties of simplicial systems and continued fraction algorithms. https://arxiv.org/abs/2001.01367

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗