A d-Step Approach for Distinct Squares in Strings

DOI10.1007/978-3-642-21458-5_9zbMath1339.68217OpenAlexW195053133MaRDI QIDQ3011845

Antoine Deza, Frantisek Franek, Mei Jiang

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_9

zbMATH Keywords

string\(d\)-step approachdistinct squaresprimitively rooted distinct squares

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (6)

Characterization of dense patterns having distinct squares ⋮ Square-Density Increasing Mappings ⋮ A computational substantiation of the \(d\)-step approach to the number of distinct squares problem ⋮ Density of distinct squares in non-primitive words ⋮ Unnamed Item ⋮ A \(d\)-step approach to the maximum number of distinct squares and runs in strings

Cites Work

• On the structure of run-maximal strings
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings
• 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
• Unnamed Item

This page was built for publication: A d-Step Approach for Distinct Squares in Strings