A Stronger Square Conjecture on Binary Words

DOI10.1007/978-3-319-04298-5_30zbMath1432.68375OpenAlexW166520803MaRDI QIDQ2938111

Shinnosuke Seki, Florin Manea, Nataša Jonoska

Publication date: 13 January 2015

Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_30

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

Characterization of dense patterns having distinct squares ⋮ Clusters of repetition roots: single chains ⋮ Square-Density Increasing Mappings ⋮ Constructing Words with High Distinct Square Densities ⋮ The square density of words having a sequence of FS-double squares ⋮ On the Number of Distinct Squares in Finite Sequences: Some Old and New Results ⋮ An upper bound of the number of distinct powers in binary words ⋮ Bi-immunity over different size alphabets ⋮ Square network on a word ⋮ Clusters of repetition roots forming prefix chains

This page was built for publication: A Stronger Square Conjecture on Binary Words