Distinct Squares in Circular Words
From MaRDI portal
Publication:5150916
DOI10.1007/978-3-319-67428-5_3zbMath1454.68115arXiv1708.00639OpenAlexW2742162059MaRDI QIDQ5150916
Publication date: 16 February 2021
Published in: String Processing and Information Retrieval (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.00639
Related Items
Characterization of dense patterns having distinct squares, Lower bounds for the number of repetitions in 2D strings, Density of distinct squares in non-primitive words
Cites Work
- Palindromes in circular words
- The three squares lemma revisited
- How many double squares can a string contain?
- Equations on palindromes and circular words
- On ternary square-free circular words
- Circular Sturmian words and Hopcroft's algorithm
- Intersecting periodic words
- How many squares can a string contain?
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Squares, cubes, and time-space efficient string searching
- Three overlapping squares: the general case characterized \& applications
- A note on the number of squares in a word
- More results on overlapping squares
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
- The Maximum Number of Squares in a Tree
- Square-Density Increasing Mappings
- Uniqueness Theorems for Periodic Functions
- A New Periodicity Lemma
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
