Note on BDL property of fixed points of primitive morphisms

2022/02/03 by Petr Ambrož, Edita Pelantová, Ambrož, Petr +1
Computer Science · Mathematics · #52C23 #68R15 #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2202.01492

openalex publication_date 2022/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider an infinite word \boldsymbolu fixed by a primitive morphism. We show a necessary condition under which \boldsymbolu has a non-trivial geometric representation which is bounded distance equivalent to a lattice.

Related

• Fixed points of morphisms among binary generalized pseudostandard words
• On the subword complexity of the fixed point of a → aab, b → b, and generalizations
• The equality problem for infinite words generated by primitive morphisms
• Anti-Powers in Primitive Uniform Substitutions
• The constant of recognizability is computable for primitive morphisms