Palindromic sequences generated from marked morphisms

DOI10.1016/J.EJC.2015.05.006MaRDI QIDQ499461zbMATH OpenOpenAlexFDO

Authors Edita Pelantová, Sébastien Labbé

Publication date 30 September 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.7510

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Abstract: Fixed points $$ of marked and primitive morphisms $varphi$ over arbitrary alphabet are considered. We show that if $$ is palindromic, i.e., its language contains infinitely many palindromes, then some power of $varphi$ has a conjugate in class $mathcalP$. This class was introduced by Hof, Knill, Simon (1995) in order to study palindromic morphic words. Our definitions of marked and well-marked morphisms are more general than the ones previously used by Frid (1999) or Tan (2007). As any morphism with aperiodic fixed point over binary alphabet is marked, our result generalizes the result of Tan. Labb'e (2014) demonstrated that already on a ternary alphabet the property of morphisms to be marked is important for the validity of our theorem. The main tool used in our proof is the description of bispecial factors in fixed points of morphisms provided by Klouda (2012).

Recommendations

• Palindromic length of words and morphisms in class \(\mathcal{P}\)
• Palindromic richness
• Morphisms generating antipalindromic words
• Palindrome complexity.
• On palindromic factorization of words

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 1375592 (Why is no real title available?)
• scientific article; zbMATH DE number 45231 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A counterexample to a question of Hof, Knill and Simon
• Bispecial factors in circular non-pushy D0L languages
• Combinatorial properties of \(f\)-palindromes in the Thue-Morse sequence
• Equations on palindromes and circular words
• Interval exchange transformations
• Mirror substitutions and palindromic sequences
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On a question of Hof, Knill and Simon on palindromic substitutive systems
• Palindrome complexity.
• Singular continuous spectrum for palindromic Schrödinger operators
• The On-Line Encyclopedia of Integer Sequences

Cited in

(6)

• On Morphisms Preserving Palindromic Richness
• Palindromic length of words and morphisms in class \(\mathcal{P}\)
• Morphisms generating antipalindromic words
• Interval exchange words and the question of Hof, Knill, and Simon
• Exchange of three intervals: substitutions and palindromicity
• On the zero defect conjecture

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Palindromic sequences generated from marked morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499461)