A note on the number of squares in a word
From MaRDI portal
Publication:2373759
Recommendations
- A note on the number of squares in a partial word with one hole
- On the number of squares in partial words
- Counting distinct squares in partial words
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- A note on square-free shuffles of words
- The number of positions starting a square in binary words
- Words with the maximum number of abelian squares
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Density of distinct squares in non-primitive words
Cites work
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- An optimal algorithm for computing the repetitions in a word
- How many squares can a string contain?
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Squares, cubes, and time-space efficient string searching
Cited in
(49)- Repetitions in strings: algorithms and combinatorics
- String powers in trees
- Partial words with a unique position starting a square
- On k-abelian palindromes
- On the maximum number of cubic subwords in a word
- How many square occurrences must a binary sequence contain?
- Clusters of repetition roots forming prefix chains
- Lower bounds for the number of repetitions in 2D strings
- Square network on a word
- Efficient counting of square substrings in a tree
- Abelian-square-rich words
- On the average number of regularities in a word
- Squares in partial words
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- On the number of \(k\)-powers in a finite word
- On shuffled-square-free words
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- A stronger square conjecture on binary words
- String Powers in Trees
- A d-step approach for distinct squares in strings
- 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
- Words with the maximum number of abelian squares
- Square-density increasing mappings
- A note on the number of squares in a partial word with one hole
- Extracting powers and periods in a word from its runs structure
- The three-squares lemma for partial words with one hole
- How many double squares can a string contain?
- scientific article; zbMATH DE number 6133343 (Why is no real title available?)
- A d-step approach to the maximum number of distinct squares and runs in strings
- Constructing words with high distinct square densities
- The simplest binary word with only three squares
- Distinct squares in circular words
- Infinite words containing squares at every position
- On the number of squares in partial words
- The number of repetitions in 2D-strings
- Distinct squares in run-length encoded strings
- The length of the longest sequence of consecutive FS-double squares in a word
- Density of distinct squares in non-primitive words
- An upper bound of the number of distinct powers in binary words
- The number of positions starting a square in binary words
- Lyndon Words, the Three Squares Lemma, and Primitive Squares
- A note on the maximum number of k-powers in a finite word
- Optimal bounds for distinct quartics
- On the number of squares in a finite word
- On the number of frames in binary words
- Clusters of repetition roots: single chains
- Maximal repetitions in strings
This page was built for publication: A note on the number of squares in a word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373759)
