A d-step approach to the maximum number of distinct squares and runs in strings
From MaRDI portal
Publication:496539
Recommendations
Cites work
- A \(d\)-step approach for distinct squares in strings
- A characterization of the squares in a Fibonacci string
- A computational framework for determining run-maximal strings
- A continuous d-step conjecture for polytopes
- A counterexample to the Hirsch conjecture
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Detecting leftmost maximal periodicities
- How many squares can a string contain?
- On the maximum number of cubic subwords in a word
- On the structure of run-maximal strings
- Squares, cubes, and time-space efficient string searching
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- The ``runs conjecture
Cited in
(14)- On the Maximal Sum of Exponents of Runsin a String
- On the maximal sum of exponents of runs in a string
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- Constructing words with high distinct square densities
- Distinct squares in run-length encoded strings
- A computational substantiation of the d-step approach to the number of distinct squares problem
- A computational framework for determining run-maximal strings
- How many double squares can a string contain?
- A \(d\)-step approach for distinct squares in strings
- The ``runs theorem
- On the density of Lyndon roots in factors
- Bannai et al. method proves the \(d\)-step conjecture for strings
- The number of q-ary words with restrictions on the length of the maximal run
This page was built for publication: A \(d\)-step approach to the maximum number of distinct squares and runs in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496539)
