Characterization of dense patterns having distinct squares

DOI10.1007/978-3-030-67899-9_32MaRDI QIDQ831749OpenAlexFDO

Authors Maithilee Patawar, Kalpesh Kapoor

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67899-9_32

zbMATH Keywords

word combinatoricsdistinct squaresword patterns

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• A \(d\)-step approach for distinct squares in strings
• A stronger square conjecture on binary words
• Constructing words with high distinct square densities
• Distinct squares in circular words
• How many double squares can a string contain?
• How many squares can a string contain?
• Square-density increasing mappings

Cited in

(3)

• The square density of words having a sequence of FS-double squares
• The length of the longest sequence of consecutive FS-double squares in a word
• Density of distinct squares in non-primitive words

This page was built for publication: Characterization of dense patterns having distinct squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831749)