Recognizability for sequences of morphisms
From MaRDI portal
Abstract: We investigate different notions of recognizability for a free monoid morphism . Full recognizability occurs when each (aperiodic) point in admits at most one tiling with words , . This is stronger than the classical notion of recognizability of a substitution , where the tiling must be compatible with the language of the substitution. We show that if , or if 's incidence matrix has rank , or if is permutative, then is fully recognizable. Next we investigate the classical notion of recognizability and improve earlier results of Moss'{e} (1992) and Bezuglyi, Kwiatkowski and Medynets (2009), by showing that any substitution is recognizable for aperiodic points in its substitutive shift. Finally we define recognizability and also eventual recognizability for sequences of morphisms which define an -adic shift. We prove that a sequence of morphisms on alphabets of bounded size, such that compositions of consecutive morphisms are growing on all letters, is eventually recognizable for aperiodic points. We provide examples of eventually recognizable, but not recognizable, sequences of morphisms, and sequences of morphisms which are not eventually recognizable. As an application, for a recognizable sequence of morphisms, we obtain an almost everywhere bijective correspondence between the -adic shift it generates, and the measurable Bratteli-Vershik dynamical system that it defines.
Recommendations
- Recognizability of morphisms
- Decidability of uniform recurrence of morphic sequences
- The complexity of weakly recognizing morphisms
- Finitely presentable morphisms in exact sequences
- Morphisms, Symbolic sequences, and their Standard Forms
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Finite morphisms and Nash multiplicity sequences
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Exact homomorphism sequences in homology theory
- The constant of recognizability is computable for primitive morphisms
Cites work
- S-adic conjecture and Bratteli diagrams
- A theorem on the Markov periodic approximation in ergodic theory
- Aperiodic substitution systems and their Bratteli diagrams
- Beyond substitutive dynamical systems: S-adic expansions
- Bratteli diagrams where random orders are imperfect
- Cantor aperiodic systems and Bratteli diagrams
- Characterization of circular D0L-systems
- Conjugacies for tiling dynamical systems
- Constructive symbolic presentations of rank one measure-preserving systems
- Dynamical properties of some adic systems with arbitrary orderings
- Finite Gauss measure on the space of interval exchange transformations. Lyapunov exponents
- Finite-rank Bratteli-Vershik diagrams are expansive -- a new proof
- Finite-rank Bratteli–Vershik diagrams are expansive
- Finiteness and recognizability problems for substitution maps on two symbols
- Fusion: a general framework for hierarchical tilings of \(\mathbb{R }^d\)
- Geometric representation of substitutions of Pisot type
- Geometric representation of the infimax S-adic family
- scientific article; zbMATH DE number 6498000 (Why is no real title available?)
- scientific article; zbMATH DE number 124862 (Why is no real title available?)
- scientific article; zbMATH DE number 2236674 (Why is no real title available?)
- If a DOL language is k-power free then it is circular
- Imbalances in Arnoux-Rauzy sequences
- Invariant measures on stationary Bratteli diagrams
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Maximal bifix decoding
- Minimal flows arising from substitutions of non-constant length
- Multidimensional Euclidean algorithms, numeration and substitutions
- Nonperiodicity implies unique composition for self-similar translationally finite tilings
- NONSTATIONARY MIXING AND THE UNIQUE ERGODICITY OF ADIC TRANSFORMATIONS
- On automorphism groups of low complexity subshifts
- Power of words and recognizability of fixpoints of a substitution
- Prefix-suffix automaton associated with a primitive substitution
- Presentations of Schützenberger groups of minimal subshifts.
- Rank and symbolic complexity
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Représentation géométrique de suites de complexité 2n+1
- Substitution dynamical systems. Spectral analysis
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Systems of finite rank
- The Cech cohomology and the spectrum for 1-dimensional tiling systems
- The cohomological equation for Roth-type interval exchange maps
- The constant of recognizability is computable for primitive morphisms
- The scenery flow for geometric structures on the torus: The linear setting
- Thermodynamic formalism and \(k\)-Bonacci substitutions
- Topological invariants for substitution tilings and their associated C^\ast-algebras
- Uniqueness Theorems for Periodic Functions
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
- Weak mixing and eigenvalues for Arnoux-Rauzy sequences
Cited in
(44)- A spectral cocycle for substitution systems and translation flows
- Hölder regularity for the spectrum of translation flows
- Spectral properties of Schrödinger operators associated with almost minimal substitution systems
- Substitutive systems and a finitary version of Cobham's theorem
- Mixing properties and entropy bounds of a family of Pisot random substitutions
- A self-similar aperiodic set of 19 Wang tiles
- Geometry, dynamics, and arithmetic of S-adic shifts
- On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts
- Substitutive structure of Jeandel-Rao aperiodic tilings
- Decidability of uniform recurrence of morphic sequences
- The constant of recognizability is computable for primitive morphisms
- Periodic codings of Bratteli-Vershik systems
- Morphisms, Symbolic sequences, and their Standard Forms
- scientific article; zbMATH DE number 512831 (Why is no real title available?)
- -adic characterization of minimal ternary dendric shifts
- On the automorphism group of minimal \(\mathcal{S}\)-adic subshifts of finite alphabet rank
- On topological rank of factors of Cantor minimal systems
- Interplay between finite topological rank minimal Cantor systems, S-adic subshifts and their complexity
- Symbolic factors of -adic subshifts of finite alphabet rank
- Homomorphisms between multidimensional constant-shape substitutions
- Torsion-free $S$-adic shifts and their spectrum
- Recognizability of morphisms
- Dynamical properties of minimal Ferenczi subshifts
- Spectral characteristics of Schrödinger operators generated by product systems
- Decidable problems in substitution shifts
- On the structure of generic subshifts
- Substitution-dynamics and invariant measures for infinite alphabet-path space
- The recognition theorem for \(\text{Out}(F_n)\).
- Unambiguously coded shifts
- The Jacobs-Keane theorem from the \(\mathcal{S}\)-adic viewpoint
- Renormalization operator for substitutions
- Automorphism groups of random substitution subshifts
- Flow views and infinite interval exchange transformations for recognizable substitutions
- The measure transfer for subshifts induced by a morphism of free monoids
- Quasi-fixed points of substitutive systems
- Various questions around finitely positively expansive dynamical systems
- On the minimal components of substitution subshifts
- Coboundaries and eigenvalues of finitary S-adic systems
- Metallic mean Wang tiles. I: Self-similarity, aperiodicity and minimality
- On partial rigidity of \(\mathcal{S}\)-adic subshifts
- Subshifts of finite symbolic rank
- Measure transfer and S-adic developments for subshifts
- Interval translation maps with weakly mixing attractors
- Recognizability in S-adic shifts
This page was built for publication: Recognizability for sequences of morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235114)