The following pages link to Not So Many Runs in Strings (Q3540112):
Displaying 23 items.
- The total run length of a word (Q391314) (← links)
- On the structure of run-maximal strings (Q414413) (← links)
- The three squares lemma revisited (Q414439) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Asymptotic behavior of the numbers of runs and microruns (Q1041040) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
- Bounds on Powers in Strings (Q3533012) (← links)
- A Series of Run-Rich Strings (Q3618614) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- (Q5874500) (← links)
