How many square occurrences must a binary sequence contain?
type: Item
instance of: scholarly article
title: How many square occurrences must a binary sequence contain?
zbMATH Open document ID: 1011.05007
author: Gregory Kucherov
author: Pascal Ochem
author: Michaël Rao
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-07T00:00:00Z
full work available at URL: https://eudml.org/doc/122596
full work available at URL: v10i1r12.html
review text: Summary: Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed that three distinct squares are necessary and sufficient to construct an infinite binary word. We study the following complementary question: how many square occurrences must a binary word contain? We show that this quantity is, in the limit, a constant fraction of the word length, and prove that this constant is 0.55080....
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1907097
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1907097