The square density of words having a sequence of FS-double squares

DOI10.1016/j.dam.2023.08.021OpenAlexW4386580049MaRDI QIDQ6069178

Maithilee Patawar, Kalpesh Kapoor

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.021

zbMATH Keywords

squaresrepetitionsword combinatoricsFS-double squares

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Enumerative combinatorics (05Axx)

Cites Work

• The new periodicity lemma revisited
• Extracting powers and periods in a word from its runs structure
• How many double squares can a string contain?
• Characterization of dense patterns having distinct squares
• How many squares can a string contain?
• On the maximum number of cubic subwords in a word
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Squares and primitivity in partial words
• A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
• A Stronger Square Conjecture on Binary Words
• Square-Density Increasing Mappings
• Constructing Words with High Distinct Square Densities
• Unnamed Item

This page was built for publication: The square density of words having a sequence of FS-double squares