An upper bound of the number of distinct powers in binary words

DOI10.1016/j.disc.2024.113902arXiv2209.06891WikidataQ129445405 ScholiaQ129445405MaRDI QIDQ6197757

Shuo Li

Publication date: 19 February 2024

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

Full work available at URL: https://arxiv.org/abs/2209.06891

zbMATH Keywords

binary wordscombinatorics on wordssquare factors

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Enumerative combinatorics (05Axx)

Cites Work

• Unnamed Item
• How many double squares can a string contain?
• k-optimal partitions of a directed graph
• How many squares can a string contain?
• On the maximum number of cubic subwords in a word
• A note on the number of squares in a word
• On the number of \(k\)-powers in a finite word
• A Stronger Square Conjecture on Binary Words
• Square-Density Increasing Mappings

This page was built for publication: An upper bound of the number of distinct powers in binary words