How many squares can a string contain?
From MaRDI portal
Publication:1268630
Recommendations
- How many double squares can a string contain?
- How many runs can a string contain?
- How many squares must a binary sequence contain?
- How many square occurrences must a binary sequence contain?
- How many strings are easy to predict?
- How many strings are easy to predict?
- How Many Magic Squares Are There?
- scientific article; zbMATH DE number 653237
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- An optimal algorithm for computing the repetitions in a word
- Corrigendum to: ``The exact number of squares in Fibonacci words
- How many squares must a binary sequence contain?
- On nonrepetitive sequences
- Squares, cubes, and time-space efficient string searching
- Uniqueness Theorems for Periodic Functions
Cited in
(65)- String Powers in Trees
- New simple efficient algorithms computing powers and runs in strings
- Abelian combinatorics on words: a survey
- scientific article; zbMATH DE number 7651171 (Why is no real title available?)
- Repetitions in Toeplitz words and the Thue threshold
- Characterization of dense patterns having distinct squares
- Clusters of repetition roots: single chains
- Palindromic complexity of trees
- Constructing words with high distinct square densities
- Finite and infinite closed-rich words
- Partial words with a unique position starting a square
- A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE
- Clusters of repetition roots forming prefix chains
- Maximal repetitions in strings
- On the number of squares in partial words
- Density of distinct squares in non-primitive words
- Square network on a word
- The three-squares lemma for partial words with one hole
- On closed-rich words
- String powers in trees
- Optimality of some algorithms to detect quasiperiodicities
- How many squares must a binary sequence contain?
- Square-density increasing mappings
- Linear-time computation of local periods
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- On the maximal number of cubic subwords in a string
- On the number of frames in binary words
- Abelian-square-rich words
- Distinct squares in circular words
- Extracting powers and periods in a word from its runs structure
- Efficient counting of square substrings in a tree
- Bi-immunity over different size alphabets
- The length of the longest sequence of consecutive FS-double squares in a word
- Distinct squares in run-length encoded strings
- On the average number of regularities in a word
- The exact number of squares in Fibonacci words
- A computational substantiation of the d-step approach to the number of distinct squares problem
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- Lower bounds for the number of repetitions in 2D strings
- Simple and flexible detection of contiguous repeats using a suffix tree
- How many double squares can a string contain?
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings
- Repetitions in strings: algorithms and combinatorics
- The square density of words having a sequence of FS-double squares
- A note on the maximum number of \(k\)-powers in a finite word
- A note on the number of squares in a partial word with one hole
- The number of positions starting a square in binary words
- On the number of \(k\)-powers in a finite word
- An upper bound of the number of distinct powers in binary words
- On the Number of Distinct Squares in Finite Sequences: Some Old and New Results
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Shortest covers of all cyclic shifts of a string
- Lyndon Words, the Three Squares Lemma, and Primitive Squares
- On a lemma of Crochemore and Rytter
- Fast algorithm for partial covers in words
- A \(d\)-step approach for distinct squares in strings
- The maximum number of squares in a tree
- Efficient enumeration of non-equivalent squares in partial words with few holes
- Words with the maximum number of abelian squares
- On the maximum number of cubic subwords in a word
- A note on the number of squares in a word
- On longest common property preserved substring queries
- Bannai et al. method proves the \(d\)-step conjecture for strings
- Squares in partial words
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
This page was built for publication: How many squares can a string contain?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268630)
