Abstract
We answer a question of Brešar et al. about the structure of non-repetitive words: For any sequence A of positive integers with large enough gaps, there is a ternary non-repetitive word having a length 3 palindrome starting at each position a ∈ A . In fact, we can find ternary non-repetitive words such that for each a ∈ A , the length 3 subword starting at position a is a palindrome or not, as one chooses. This arbitrariness in the positioning of subwords contrasts markedly with the situation for binary overlap-free words.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
