Characterization of dense patterns having distinct squares

DOI10.1007/978-3-030-67899-9_32OpenAlexW3128658084MaRDI QIDQ831749FDOQ831749

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

• Title not available (Why is that?)
• How many squares can a string contain?
• A \(d\)-step approach for distinct squares in strings
• How many double squares can a string contain?
• A stronger square conjecture on binary words
• Constructing words with high distinct square densities
• Square-density increasing mappings
• Distinct squares in circular words

Cited In (3)

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

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)