The following pages link to The ``runs'' conjecture (Q544875):
Displayed 21 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- The total run length of a word (Q391314) (← links)
- On palindromic factorization of words (Q394756) (← links)
- Palindromes in circular words (Q401312) (← links)
- On the structure of run-maximal strings (Q414413) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- On closed-rich words (Q2117106) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- (Q5874500) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)