Abstract
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible number of distinct closed factors. As the main result, we show that for finite words the asymptotics of the maximal number of distinct closed factors in a word of length n is n26. For infinite words, we show that there exist words such that each their factor of length n contains a quadratic number of distinct closed factors, with uniformly bounded constant; we call such words infinite closed-rich. We provide several necessary and some sufficient conditions for a word to be infinite closed rich. For example, we show that all linearly recurrent words are closed-rich. We provide a characterization of rich words among Sturmian words. Certain examples we provide involve non-constructive methods.
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.
