Towards a Solution to the “Runs” Conjecture

68R15: Combinatorics on words

Related Items

On the size of overlapping Lempel-Ziv and Lyndon factorizations, On the structure of run-maximal strings, The three squares lemma revisited, On the maximal sum of exponents of runs in a string, Average number of occurrences of repetitions in a necklace, Computing the number of cubic runs in standard Sturmian words, Bannai et al. method proves the \(d\)-step conjecture for strings, The ``runs conjecture, On primary and secondary repetitions in words, On maximal repetitions of arbitrary exponent, Repetitions in strings: algorithms and combinatorics, Asymptotic behavior of the numbers of runs and microruns, Searching of gapped repeats and subrepetitions in a word, On the number of gapped repeats with arbitrary gap, The maximal number of cubic runs in a word, Computing regularities in strings: a survey, On the maximum number of cubic subwords in a word, Optimal bounds for computing \({\alpha}\)-gapped repeats, Some results on the number of periodic factors in words, Three overlapping squares: the general case characterized \& applications, On the average number of regularities in a word, ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS, On the Maximal Sum of Exponents of Runsin a String, A Series of Run-Rich Strings

Cites Work