Pages that link to "Item:Q476303"
From MaRDI portal
The following pages link to How many double squares can a string contain? (Q476303):
Displaying 33 items.
- The new periodicity lemma revisited (Q313759) (← links)
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- Distinct squares in run-length encoded strings (Q606988) (← links)
- Characterization of dense patterns having distinct squares (Q831749) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- How many squares must a binary sequence contain? (Q1346736) (← links)
- String powers in trees (Q1679231) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- On closed-rich words (Q2117106) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Square network on a word (Q2243587) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974) (← links)
- On the number of \(k\)-powers in a finite word (Q2672960) (← links)
- Square-Density Increasing Mappings (Q3449366) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- (Q5874500) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)
- (Q6150948) (← links)
- Density of distinct squares in non-primitive words (Q6161432) (← links)
- An upper bound of the number of distinct powers in binary words (Q6197757) (← links)
- A note on the maximum number of \(k\)-powers in a finite word (Q6614167) (← links)
