Lower bounds for the number of repetitions in 2D strings
From MaRDI portal
Publication:2146138
DOI10.1007/978-3-030-86692-1_15OpenAlexW3201840946MaRDI QIDQ2146138
Gad M. Landau, Samah Ghazawi, Paweł Gawrychowski
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2105.14903
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extracting powers and periods in a word from its runs structure
- Palindromes in circular words
- How many double squares can a string contain?
- The ``runs conjecture
- Maximal repetitions in strings
- How many runs can a string contain?
- How many squares can a string contain?
- Optimal parallel two dimensional text searching on a CREW PRAM
- Fibonacci arrays and their two-dimensional repetitions
- String powers in trees
- Squares, cubes, and time-space efficient string searching
- Two-dimensional maximal repetitions
- Prefix frequency of lost positions
- 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
- The Maximum Number of Squares in a Tree
- Square-Density Increasing Mappings
- Universal Reconstruction of a String
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- Not So Many Runs in Strings
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Two-Dimensional Periodicity in Rectangular Arrays
- Distinct Squares in Circular Words
- The “Runs” Theorem
- Episturmian words and some constructions of de Luca and Rauzy
