The number of positions starting a square in binary words

MaRDI QIDQ625366zbMATH OpenFDO

Authors Tomi Kärki, Dirk Nowotka, Tero Harju

Publication date 17 February 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/227834, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p6.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Review text

Summary: We consider the number \(\sigma (w)\) of positions that do not start a square in binary words w. Letting \(\sigma (n)\) denote the maximum of \(\sigma (w)\) for length \(|w| = n\), we show that lim \(\sigma (n)/n = 15/31\).

Recommendations

• Squares in binary partial words
• How many square occurrences must a binary sequence contain?
• Squares in partial words
• A note on the number of squares in a word
• How many squares can a string contain?

Cited in

(10)

• How many squares must a binary sequence contain?
• Partial words with a unique position starting a square
• On k-abelian palindromes
• How many square occurrences must a binary sequence contain?
• A note on the number of squares in a word
• Squares in partial words
• A stronger square conjecture on binary words
• Constructing words with high distinct square densities
• The simplest binary word with only three squares
• On the number of frames in binary words

This page was built for publication: The number of positions starting a square in binary words

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