Abstract
We study the avoidability of long k k -abelian-squares and k k -abelian-cubes on binary and ternary alphabets. For k = 1 k=1 , these are MĂ€kelĂ€âs questions. We show that one cannot avoid abelian-cubes of abelian period at least 2 2 in infinite binary words, and therefore answering negatively one question from MĂ€kelĂ€. Then we show that one can avoid 3 3 -abelian-squares of period at least 3 3 in infinite binary words and 2 2 -abelian-squares of period at least 2 in infinite ternary words. Finally, we study the minimum number of distinct k k -abelian-squares that must appear in an infinite binary word.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.