On the entropy of a two step random Fibonacci substitution (Q280510): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: M. Dambrine / rank
 
Normal rank
Property / review text
 
Summary: We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, \(\mathsf a\mapsto\mathsf{baa}\) and \(\mathsf b\mapsto\mathsf{ab}\), with probability \(p\), and \(\mathsf b\mapsto\mathsf{ba}\), with probability \(1-p\) for \(0<p<1\), and where the random rule is applied each time it acts on \(\mathsf a\) . We show that the topological entropy of this object is given by the growth rate of the set of inflated random Fibonacci words, and we exactly calculate its value.
Property / review text: Summary: We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, \(\mathsf a\mapsto\mathsf{baa}\) and \(\mathsf b\mapsto\mathsf{ab}\), with probability \(p\), and \(\mathsf b\mapsto\mathsf{ba}\), with probability \(1-p\) for \(0<p<1\), and where the random rule is applied each time it acts on \(\mathsf a\) . We show that the topological entropy of this object is given by the growth rate of the set of inflated random Fibonacci words, and we exactly calculate its value. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 54C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6578331 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorics on words
Property / zbMATH Keywords: combinatorics on words / rank
 
Normal rank
Property / zbMATH Keywords
 
asymptotic enumeration
Property / zbMATH Keywords: asymptotic enumeration / rank
 
Normal rank
Property / zbMATH Keywords
 
symbolic dynamics
Property / zbMATH Keywords: symbolic dynamics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3106157583 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.2526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiperiodicity and randomness in tilings of the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropy of a family of random substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nature of the atomic surfaces of quasiperiodic self-similar structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:06, 11 July 2024

scientific article
Language Label Description Also known as
English
On the entropy of a two step random Fibonacci substitution
scientific article

    Statements

    On the entropy of a two step random Fibonacci substitution (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2016
    0 references
    Summary: We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, \(\mathsf a\mapsto\mathsf{baa}\) and \(\mathsf b\mapsto\mathsf{ab}\), with probability \(p\), and \(\mathsf b\mapsto\mathsf{ba}\), with probability \(1-p\) for \(0<p<1\), and where the random rule is applied each time it acts on \(\mathsf a\) . We show that the topological entropy of this object is given by the growth rate of the set of inflated random Fibonacci words, and we exactly calculate its value.
    0 references
    combinatorics on words
    0 references
    asymptotic enumeration
    0 references
    symbolic dynamics
    0 references

    Identifiers