On the Number of Distinct Squares in Finite Sequences: Some Old and New Results

DOI10.1007/978-3-031-33180-0_3MaRDI QIDQ6134860OpenAlexFDO

Authors Srečko Brlek, Shuo Li

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-33180-0_3

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• A stronger square conjecture on binary words
• How many double squares can a string contain?
• How many squares can a string contain?
• STACS 2004

Cited in

(1)

• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem

This page was built for publication: On the Number of Distinct Squares in Finite Sequences: Some Old and New Results

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