A stronger square conjecture on binary words

DOI10.1007/978-3-319-04298-5_30MaRDI QIDQ2938111zbMATH OpenOpenAlexFDO

Authors Florin Manea, Shinnosuke Seki, 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)

Recommendations

• Square-density increasing mappings
• A note on the number of squares in a word
• The number of positions starting a square in binary words
• Distinct squares in circular words
• How many square occurrences must a binary sequence contain?

Cited in

(16)

• Binary words with a given Diophantine exponent
• Clusters of repetition roots forming prefix chains
• Bi-immunity over different size alphabets
• Square network on a word
• Palindromic subsequences in finite words
• Existence of words over a binary alphabet free from squares with mismatches
• On the number of \(k\)-powers in a finite word
• Square-density increasing mappings
• Solution to a conjecture on words that are bad and 2-isometric
• Constructing words with high distinct square densities
• Distinct squares in circular words
• 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
• Characterization of dense patterns having distinct squares
• Clusters of repetition roots: single chains

This page was built for publication: A stronger square conjecture on binary words

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