Morphisms generating antipalindromic words

DOI10.1016/J.EJC.2020.103160zbMATH Open1448.68364arXiv1906.06174OpenAlexW3034826787MaRDI QIDQ2198987FDOQ2198987

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

Publication date: 15 September 2020

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

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.

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

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

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

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)