Constructing Words with High Distinct Square Densities
From MaRDI portal
Publication:5016360
zbMath1483.68269arXiv1708.06462MaRDI QIDQ5016360
No author found.
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1708.06462
Related Items
Characterization of dense patterns having distinct squares, The square density of words having a sequence of FS-double squares
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extracting powers and periods in a word from its runs structure
- The three squares lemma revisited
- The three-squares lemma for partial words with one hole
- How many double squares can a string contain?
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings
- The number of positions starting a square in binary words
- Repetitions in strings: algorithms and combinatorics
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- How many squares can a string contain?
- How many squares must a binary sequence contain?
- Computing primitively-rooted squares and runs in partial words
- On the maximum number of cubic subwords in a word
- Linear time algorithms for finding and representing all the tandem repeats in a string
- How many square occurrences must a binary sequence contain?
- Squares, cubes, and time-space efficient string searching
- Squares and primitivity in partial words
- A note on the number of squares in a word
- More results on overlapping squares
- Squares in partial words
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- A Stronger Square Conjecture on Binary Words
- Computing Primitively-Rooted Squares and Runs in Partial Words
- An O(n log n) algorithm for finding all repetitions in a string
- Square-Density Increasing Mappings
- A note on the number of squares in a partial word with one hole
- Compression of individual sequences via variable-rate coding
- Algorithms on Strings, Trees and Sequences
- Two-way string-matching
- Jewels of Stringology
- On the number of squares in partial words
- Algorithms on Strings
- A New Periodicity Lemma
