A generalization of Cobham's theorem
From MaRDI portal
Abstract: If a non-periodic sequence is the image by a morphism of a fixed point of both a primitive substitution and a primitive substitution , then the dominant eigenvalues of the matrices of and of are multiplicatively dependent. This is the way we propose to generalize Cobham's Theorem.
Recommendations
Cited in
(36)- Self-similar tiling systems, topological factors and stretching factors
- On recognizable sets of integers
- A generalization of Obata's theorem
- Invertible substitutions and local isomorphisms
- Substitutive systems and a finitary version of Cobham's theorem
- Pronilpotent quotients associated with primitive substitutions
- Some remarks about stabilizers
- Dynamical directions in numeration
- Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
- Syndeticity and independent substitutions
- A connection between palindromic and factor complexity using return words
- New techniques for classifying Williams solenoids
- Rigidity in one-dimensional tiling spaces
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
- Hybrid quasicrystals, transport and localization in products of minimal sets
- Asymptotic properties of free monoid morphisms
- Eigenvalues and transduction of morphic sequences
- scientific article; zbMATH DE number 3844423 (Why is no real title available?)
- Une généralisation du théorème de Cobham
- scientific article; zbMATH DE number 1984012 (Why is no real title available?)
- A theorem of Cobham for non-primitive substitutions
- Cobham's Theorem seen through Büchi's Theorem
- Cobham's theorem and its extensions
- On multiplicatively dependent linear numeration systems, and periodic points
- An extension of the Cobham-Semënov Theorem
- scientific article; zbMATH DE number 7594606 (Why is no real title available?)
- On Morphisms Preserving Palindromic Richness
- Derived sequences of complementary symmetric Rote sequences
- Cobham’s Theorem and Automaticity
- Singular substitutions of constant length
- Episturmian words: a survey
- Quantitative estimates for the size of an intersection of sparse automatic sets
- On Substitutions Preserving Their Return Sets
- An asymptotic version of Cobham’s theorem
- Conjugacy of unimodular Pisot substitution subshifts to domain exchanges
- Cobham's theorem for substitutions
This page was built for publication: A generalization of Cobham's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386653)