scientific article; zbMATH DE number 7814389
From MaRDI portal
Publication:6150948
DOI10.22049/cco.2022.27917.1395arXiv2107.07473MaRDI QIDQ6150948
Kalpesh Kapoor, Maithilee Patawar
Publication date: 7 March 2024
Full work available at URL: https://arxiv.org/abs/2107.07473
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- The new periodicity lemma revisited
- How many double squares can a string contain?
- Characterization of dense patterns having distinct squares
- The origins of combinatorics on words
- An optimal algorithm for computing the repetitions in a word
- How many squares can a string contain?
- 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
- A d-Step Approach for Distinct Squares in Strings
- Square-Density Increasing Mappings
- Uniqueness Theorems for Periodic Functions
This page was built for publication:
