activity
20032023
most citedConstant-length substitutions and countable scrambled sets

33 citations · 60 across the 24 of their papers we have counts for

collaborators
Showing 2008 · math.DSShow all

9 papers · 2 filters

math.DS2008

Corrigendum and addendum to: Linearly recurrent subshifts have a finite number of non-periodic factors

Fabien Durand

We prove that a subshift is linearly recurrent if and only if it is a primitive and proper -adic subshift. This corrects Proposition 6 in F. Durand ({\it Ergod. Th. & Dy…

math.DS2008★ 33 cited

Constant-length substitutions and countable scrambled sets

François Blanchard, Fabien Durand, Alejandro Maass

In this paper we provide examples of topological dynamical systems having either finite or countable scrambled sets. In particular we study conditions for the existence of Li-Yorke…

math.DS2008★ 6 cited

Limit laws of entrance times for low complexity Cantor minimal systems

Fabien Durand, Alejandro Maass

This paper is devoted to the study of limit laws of entrance times to cylinder sets for Cantor minimal systems of zero entropy using their representation by means of ordered Bratte…

math.DS2008

Ergodic averages with deterministic weights

Fabien Durand, Dominique Schneider

The purpose of this paper is to study ergodic averages with deterministic weights. More precisely we study the convergence of the ergodic averages of the type $\frac{1}{N} \sum_{k=…

math.DS2008

Linearly recurrent subshifts have a finite number of non-periodic subshift factors

Fabien Durand

A minimal subshift is linearly recurrent if there exists a constant so that for each clopen set generated by a finite word the return time to , with respect…

math.DS2008

Substitutional dynamical systems, Bratteli diagrams and dimension groups

Fabien Durand, Bernard Host, Christian Skau

The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithm…