Pages that link to "Item:Q3506961"
From MaRDI portal
The following pages link to Towards a Solution to the “Runs” Conjecture (Q3506961):
Displaying 24 items.
- 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)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← 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)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Asymptotic behavior of the numbers of runs and microruns (Q1041040) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← 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)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← 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)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- A Series of Run-Rich Strings (Q3618614) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
