Unequal letter frequencies in ternary square-free words

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00307123
Contributor : Léa Sylvanie Elion Kivolola <>
Submitted on : Tuesday, November 25, 2008 - 2:13:11 PM
Last modification on : Thursday, January 11, 2018 - 6:20:15 AM
Long-term archiving on : Saturday, November 26, 2016 - 12:13:47 AM

File

ochem_cirm.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00307123, version 1

Collections

Citation

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

Share

Metrics

Record views

110

Files downloads

42