Morphisms generating antipalindromic words

DOI10.1016/J.EJC.2020.103160MaRDI QIDQ2198987zbMATH OpenOpenAlexFDO

Authors Petr Ambrož, Z. Masáková, Edita Pelantová

Publication date 15 September 2020

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

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We introduce two classes of morphisms over the alphabet $A=0,1$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism $mathrmE:{0,1}^{\ast }o{0,1}^{\ast }$, defined by $mathrmE(w_{1}cdots{w}_n)=(1-w_n)cdots(1-w_1)$. We conjecture that these two classes contain all morphisms (up to conjugation) which generate infinite words with infinitely many antipalindromes. This is an analogue to the famous HKS conjecture concerning infinite words containing infinitely many palindromes. We prove our conjecture for two special classes of morphisms, namely (i) uniform morphisms and (ii) morphisms with fixed points containing also infinitely many palindromes.

Recommendations

• Palindromic sequences generated from marked morphisms
• Palindromes and Sturmian words
• Palindromic length of words and morphisms in class \(\mathcal{P}\)
• Palindromic richness
• Morphic images of episturmian words having finite palindromic defect

Cites work

• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 2068881 (Why is no real title available?)
• Bispecial factors in circular non-pushy D0L languages
• Constructions of words rich in palindromes and pseudopalindromes
• Derived sequences of complementary symmetric Rote sequences
• Episturmian words and some constructions of de Luca and Rauzy
• Exchange of three intervals: substitutions and palindromicity
• Fixed points of morphisms among binary generalized pseudostandard words
• Languages invariant under more symmetries: overlapping factors versus palindromic richness
• Mirror substitutions and palindromic sequences
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On a question of Hof, Knill and Simon on palindromic substitutive systems
• On generalized pseudostandard words over binary alphabets
• On stabilizers of infinite words
• On the conjugation of standard morphisms
• Palindrome complexity.
• Palindromic complexity of codings of rotations
• Palindromic richness
• Palindromic sequences generated from marked morphisms
• Pseudopalindrome closure operators in free monoids
• Sequences with subword complexity \(2n\)
• Singular continuous spectrum for palindromic Schrödinger operators
• Substitution dynamical systems. Spectral analysis
• Substitutions in dynamics, arithmetics and combinatorics
• The Morse sequence and iterated morphisms

Cited in

(1)

• Palindromic sequences generated from marked morphisms

This page was built for publication: Morphisms generating antipalindromic words

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