Unequal letter frequencies in ternary square-free words - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Unequal letter frequencies in ternary square-free words

Résumé

We consider the set S of triples (x,y,z) corresponding tot he frequency of each alphabet letter in some infinite ternary square free word (so x + y + z = 1). We conjecture that this set is convex. We obtain bounds on S by whith a ganaralization of our method to bound the extremal frequency of one letter. This method uses weights on the alphabet letters. Finally, we obtain positive results, that is, explicit triples in S lying close to its boundary.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
ochem_cirm.pdf (102.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00307123 , version 1 (25-11-2008)

Identifiants

  • HAL Id : hal-00307123 , version 1

Citer

Pascal Ochem. Unequal letter frequencies in ternary square-free words. WORDS 2007, 2007, France. pp.388-392. ⟨hal-00307123⟩

Collections

CNRS
48 Consultations
32 Téléchargements

Partager

Gmail Facebook X LinkedIn More