Abstract
A frame is a square u u , where u is an unbordered word. Let F ( n ) denote the maximum number of distinct frames in a binary word of length n . We count this number for small values of n and show that F ( n ) is at most ⌊ n / 2 ⌋ + 8 for all n and greater than 7 n / 30 − ϵ for any positive ϵ and infinitely many n . We also show that Fibonacci words, which are known to contain plenty of distinct squares, have only a few frames. Moreover, by modifying the Thue–Morse word, we prove that the minimum number of occurrences of frames in a word of length n is ⌈ n / 2 ⌉ − 2 .
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.
