On repetition-free binary words of minimal density - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

On repetition-free binary words of minimal density

Roman Kolpakov
  • Fonction : Auteur
Yuri Tarannikov
  • Fonction : Auteur

Résumé

In \cite{KolpakovKucherovMFCS97}, a notion of minimal proportion (density) of one letter in $n$-th power-free binary words has been introduced and some of its properties have been proved. In this paper, we proceed with this study and substantially extend some of these results. First, we introduce and analyse a general notion of minimal letter density for any infinite set of words which don't contain a specified set of ``prohibited'' subwords. We then prove that for $n$-th power-free binary words, the density function is $\frac{1}{n}+\frac{1}{n^3}+\frac{1}{n^4}+ {\cal O}(\frac{1}{n^5})$ refining the estimate from \cite{KolpakovKucherovMFCS97}. Following \cite{KolpakovKucherovMFCS97}, we also consider a natural generalization of $n$-th power-free words to $x$-th power-free words for real argument $x$. We prove that the minimal proportion of one letter in $x$-th power-free binary words, considered as a function of $x$, is discontinuous at all integer points $n\geq 3$. Finally, we give an estimate of the size of the jumps.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
98-R-068.pdf (228.19 Ko) Télécharger le fichier

Dates et versions

inria-00098692 , version 1 (26-09-2006)

Identifiants

Citer

Roman Kolpakov, Gregory Kucherov, Yuri Tarannikov. On repetition-free binary words of minimal density. 23rd International Symposium on Mathematical Foundations of Computer Science - MFCS'98, 1998, Brno/Czech Republic, pp.683-692, ⟨10.1007/BFb0055819⟩. ⟨inria-00098692⟩
83 Consultations
84 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More