On repetition-free binary words of minimal density

Citation
R. Kolpakov et al., On repetition-free binary words of minimal density, THEOR COMP, 218(1), 1999, pp. 161-175
Citations number
24
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
218
Issue
1
Year of publication
1999
Pages
161 - 175
Database
ISI
SICI code
0304-3975(19990428)218:1<161:ORBWOM>2.0.ZU;2-D
Abstract
We study the minimal proportion (density) of one letter in nth power-free b inary words. First, we introduce and analyse a general notion of minimal le tter density for any infinite set of words which does not contain a specifi ed set of "prohibited" subwords. We then prove that for nth power-free bina ry words the density function is 1/n + 1/n(3) + 1/n(4) + O(1/n(5)). We also consider a generalization of nth power-free words for fractional powers (e xponents): a word is xth power-free for a real x, if it does not contain su bwords of exponent I or more. We study the minimal proportion of one letter in xth power-foe binary words as a function of x and prove, in particular, that this function is discontinuous at 7/3 as well as at all integer point s n greater than or equal to 3. Finally, we give an estimate of the size of the jumps. (C) 1999 Elsevier Science B.V. All rights reserved.