A finite word w is called closed if it has length at most 1 or it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences. An infinite word u is called closed-rich if the infimum of all possible ratios between the number of closed factors within any factor w of u and square of the length of w exists and is positive. We define this infimum as the closed-rich constant Cu of the infinite closed-rich word u. Puzynina and Parshina (2024) proved that infinite closed-rich words exist. In this paper, we estimate possible values of Cu for an infinite closed-rich word u, and apply these results to estimate the supremum Csup of the closed-rich constants of infinite closed-rich words. We show that 0.0952
Original languageEnglish
Title of host publicationCombinatorics on Words (WORDS 2025)
PublisherSpringer Nature
Pages217-229
Number of pages13
ISBN (Print)9783031975479
DOIs
StatePublished - 2025
EventWORDS 2025: biannual international conference on combinatorics on words - Nancy, France
Duration: 30 Jun 20254 Jul 2025
Conference number: 15
https://words2025.loria.fr/en/

Publication series

NameLecture notes in Computer Science
PublisherSpringer
Volume15729
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceWORDS 2025: biannual international conference on combinatorics on words
Abbreviated titleWORDS 2025
Country/TerritoryFrance
CityNancy
Period30/06/254/07/25
Internet address

    Research areas

  • Closed word, Fibonacci word, closed-rich word

ID: 142315374