Antipalindromic fixed-point classification conjecture for primitive binary morphisms
Antipalindromic fixed-point classification conjecture for primitive binary morphisms
Let be a primitive morphism on the binary alphabet , and let be an infinite fixed point of containing infinitely many antipalindromes. Let and be the two classes of morphisms defined in the paper.
Antipalindromic fixed-point classification conjecture. The morphism or its square is conjugated to a morphism in
This is presented as the main open question for morphisms with antipalindromic fixed points. The paper confirms it when is uniform or when the fixed point is palindromic.
Sources & referencesView supporting material
Primary source
Petr Ambrož, Zuzana Masáková and Edita Pelantová, “Morphisms generating antipalindromic words”, arXiv:1906.06174 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.