On the maximum number of cubic subwords in a word
From MaRDI portal
Publication:1761496
DOI10.1016/j.ejc.2012.07.012zbMath1253.68275OpenAlexW2014950183MaRDI QIDQ1761496
Jakub Radoszewski, Wojciech Rytter, Marcin Kubica, Tomasz Walen
Publication date: 15 November 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.012
Related Items (8)
String Powers in Trees ⋮ String powers in trees ⋮ On the number of \(k\)-powers in a finite word ⋮ Constructing Words with High Distinct Square Densities ⋮ The square density of words having a sequence of FS-double squares ⋮ An upper bound of the number of distinct powers in binary words ⋮ How many double squares can a string contain? ⋮ A \(d\)-step approach to the maximum number of distinct squares and runs in strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal repetitions in strings
- How many runs can a string contain?
- 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?
- A characterization of the squares in a Fibonacci string
- Detecting leftmost maximal periodicities
- Powers in Sturmian sequences
- Squares, cubes, and time-space efficient string searching
- A note on the number of squares in a word
- The number of runs in a string
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS
- An O(n log n) algorithm for finding all repetitions in a string
- Towards a Solution to the “Runs” Conjecture
- Not So Many Runs in Strings
- The Number of Runs in Sturmian Words
- On the Maximal Number of Cubic Subwords in a String
- Jewels of Stringology
- Uniqueness Theorems for Periodic Functions
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
This page was built for publication: On the maximum number of cubic subwords in a word
