Pages that link to "Item:Q1761496"
From MaRDI portal
The following pages link to On the maximum number of cubic subwords in a word (Q1761496):
Displaying 9 items.
- How many double squares can a string contain? (Q476303) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- String powers in trees (Q1679231) (← links)
- On the number of \(k\)-powers in a finite word (Q2672960) (← links)
- String Powers in Trees (Q2942264) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← 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)
