SearcharxivSearch

arXiv subjects

Fabien Durand

Publications and source records attributed to Fabien Durand.

At least 19 recordsLinked to original sources

Conjugacy of unimodular pisot substitutions subshifts to domain exchanges

We prove that any unimodular Pisot substitution subshift is measurably conjugate to a domain exchange in an Euclidean space which is a finite topological extension of a translation on a torus.This generalizes the pioneer works of Rauzy and Arnoux-Ito providing geometric realizations to any unimodular Pisot substitution without any additional combinatorial condition.

math.DS

The Jacobs--Keane theorem from the $\cS$-adic viewpoint

In the light of recent developments of the ${\mathcal S}$-adic study of subshifts, we revisit, within this framework, a well-known result on Toeplitz subshifts due to Jacobs--Keane giving a sufficient combinatorial condition to ensure discrete spectrum.We show that the notion of coincidences, originally introduced in the '$70$s for the study of the discrete spectrum of substitution subshifts, together with the ${\mathcal S}$-adic structure of the subshift allow to go deeper in the study of Toeplitz subshifts. We characterize spectral properties of the factor maps onto the maximal equicontinuous topological factors by means of coincidences density.We also provide an easy to check necessary and sufficient condition to ensure unique ergodicity for constant length ${\mathcal S}$-adic subshifts.

math.DS

Decidability of the isomorphism and the factorization between minimal substitution subshifts

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic, but the existing invariants are not sufficient for this purpose. We first show that given two minimal substitution subshifts, there exists a computable constant $R$ such that any factor map between these subshifts (if any) is the composition of a factor map with a radius smaller than $R$ and some power of the shift map. Then we prove that it is decidable to check whether a given sliding block code is a factor map between two prescribed minimal substitution subshifts. As a consequence of these two results, we provide an algorithm that, given two minimal substitution subshifts, decides whether one is a factor of the other and, as a straightforward corollary, whether they are isomorphic.

math.DS

Dynamical properties of minimal Ferenczi subshifts

We provide an explicit S-adic representation of rank one subshifts with bounded spacers and call the subshifts obtained in this way ''Ferenczi subshifts''. We aim to show that this approach is very convenient to study the dynamical behavior of rank one systems. For instance, we compute their topological rank, the strong and the weak orbit equivalence class. We observe that they have an induced systems that is a Toeplitz subshift having discrete spectrum. We also characterize continuous and non continuous eigenvalues of minimal Ferenczi subshifts.

math.DS

Dimension Groups and Dynamical Systems

We give a description of the link between topological dynamical systems and their dimension groups. The focus is on minimal systems and, in particular, on substitution shifts. We describe in detail the various classes of systems including Sturmian shifts and interval exchange shifts. This is a preliminary version of a book which will be published by Cambridge University Press. Any comments are of course welcome.

math.DS

On The Dimension Group of Unimodular S-Adic Subshifts

Dimension groups are complete invariants of strong orbit equivalence for minimal Cantor systems. This paper studies a natural family of minimal Cantor systems having a finitely generated dimension group, namely the primitive unimodular proper S-adic subshifts. They are generated by iterating sequences of substitutions. Proper substitutions are such that the images of letters start with a same letter, and similarly end with a same letter. This family includes various classes of subshifts such as Brun subshifts or dendric subshifts, that in turn include Arnoux-Rauzy subshifts and natural coding of interval exchange transformations. We compute their dimension group and investigate the relation between the triviality of the infinitesimal subgroup and rational independence of letter measures. We also introduce the notion of balanced functions and provide a topological characterization of bal-ancedness for primitive unimodular proper S-adic subshifts.

math.DS

Interplay between finite topological rank minimal Cantor systems, $\mathcal S$-adic subshifts and their complexity

Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems, when they are expansive, define the same class of systems, up to topological conjugacy, as primitive and recognizable ${\mathcal S}$-adic subshifts. This is done establishing necessary and sufficient conditions for a minimal subshift to be of finite topological rank. As an application, we show that minimal subshifts with non-superlinear complexity (like all classical zero entropy examples) have finite topological rank. Conversely, we analyze the complexity of ${\mathcal S}$-adic subshifts and provide sufficient conditions for a finite topological rank subshift to have a non-superlinear complexity. This includes minimal Cantor systems given by Bratteli-Vershik representations whose tower levels have proportional heights and the so called left to right ${\mathcal S}$-adic subshifts. We also exhibit that finite topological rank does not imply non-superlinear complexity. In the particular case of topological rank 2 subshifts, we prove their complexity is always subquadratic along a subsequence and their automorphism group is trivial.

math.DS

Decidability, arithmetic subsequences and eigenvalues of morphic subshifts

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding whether, given p $\in$ N, there exists such a constant subsequence along an arithmetic progression of common difference p. In the special case of uniformly recurrent automatic sequences we explicitely describe the sets of such p by means of automata.

math.DS

Eigenvalues of minimal Cantor systems

In this article we give necessary and sufficient conditions that a complex number must satisfy to be a continuous eigenvalue of a minimal Cantor system. Similarly, for minimal Cantor systems of finite rank, we provide necessary and sufficient conditions for having a measure theoretical eigenvalue. These conditions are established from the combinatorial information of the Bratteli-Vershik representations of such systems. As an application, from any minimal Cantor system, we construct a strong orbit equivalent system without irrational eigenvalues which shares all measure theoretical eigenvalues with the original system. In a second application a minimal Cantor system is constructed satisfying the so-called maximal continuous eigenvalue group property.

math.DS

On automorphism groups of Toeplitz subshifts

In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo a finite cyclic group, generated by a unique root of the shift. In the subquadratic complexity case, we show that the automorphism group modulo the torsion is generated by the roots of the shift map and that the result of the non superlinear case is optimal. Namely, for any $\varepsilon > 0$ we construct examples of minimal Toeplitz subshifts with complexity bounded by $C n^{1+ε}$ whose automorphism groups are not finitely generated. Finally, we observe the coalescence and the automorphism group give no restriction on the complexity since we provide a family of coalescent Toeplitz subshifts with positive entropy such that their automorphism groups are arbitrary finitely generated infinite abelian groups with cyclic torsion subgroup (eventually restricted to powers of the shift).

math.DS

The constant of recognizability is computable for primitive morphisms

Mossé proved that primitive morphisms are recognizable. In this paper we give a computable upper bound for the constant of recognizability of such a morphism. This bound can be expressed only using the cardinality of the alphabet and the length of the longest image under the morphism of a letter.

cs.DM

Self-Induced Systems

A minimal Cantor system is said to be self-induced whenever it is conjugate to one of its induced systems. Substitution subshifts and some odometers are classical examples, and we show that these are the only examples in the equicontinuous or expansive case. Nevertheless, we exhibit a zero entropy self-induced system that is neither equicontinuous nor expansive. We also provide non-uniquely ergodic self-induced systems with infinite entropy.Moreover, we give a characterization of self-induced minimal Cantor systems in terms of substitutions on finite or infinite alphabets.

math.DS

Eigenvalues of Toeplitz minimal systems of finite topological rank

In this article we characterize measure theoretical eigenvalues of Toeplitz Bratteli-Vershik minimal systems of finite topological rank which are not associated to a continuous eigenfunction. Several examples are provided to illustrate the different situations that can occur.

math.DS

On automorphism groups of low complexity subshifts

In this article we study the automorphism group ${\rm Aut}(X,σ)$ of subshifts $(X,σ)$ of low word complexity. In particular, we prove that Aut$(X,σ)$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain transitive subshifts with non-superlinear complexity. More precisely, the quotient of this group relative to the one generated by the shift map is a finite group. In addition, we show that any finite group can be obtained in this way. The class considered includes minimal subshifts induced by substitutions, linearly recurrent subshifts and even some subshifts which simultaneously exhibit non-superlinear and superpolynomial complexity along different subsequences. The main technique in this article relies on the study of classical relations among points used in topological dynamics, in particular, asymptotic pairs. Various examples that illustrate the technique developed in this article are provided. In particular, we prove that the group of automorphisms of a $d$-step nilsystem is nilpotent of order $d$ and from there we produce minimal subshifts of arbitrarily large polynomial complexity whose automorphism groups are also virtually $\mathbb{Z}$.

math.DS

Eigenvalues and strong orbit equivalence

We give conditions on the subgroups of the circle to be realized as the subgroups of eigenvalues of minimal Cantor systems belonging to a determined strong orbit equivalence class. Actually, the additive group of continuous eigenvalues E(X,T) of the minimal Cantor system (X,T) is a subgroup of the intersection I(X,T) of all the images of the dimension group by its traces. We show, whenever the infinitesimal subgroup of the dimension group associated to (X,T) is trivial, the quotient group I(X,T)/E(X,T) is torsion free. We give examples with non trivial infinitesimal subgroups where this property fails. We also provide some realization results.

math.DS

Decidability of uniform recurrence of morphic sequences

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.

math.CO