On the Entropy and Letter Frequencies of Ternary Square-Free Words

Simple item page
dc.creatorRichard, Christoph
dc.creatorGrimm, Uwe
dc.date2003-02-25
dc.date2003-03-19
dc.date.accessioned2026-07-07T04:55:33Z
dc.date.available2026-07-07T04:55:33Z
dc.descriptionWe enumerate all ternary length-l square-free words, which are words avoiding squares of words up to length l, for l<=24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensembles with various letter densities. We derive consequences for the free energy and entropy of ternary square-free words.
dc.description17 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0302302
dc.identifierhttp://arxiv.org/abs/math/0302302
dc.identifierThe Electronic Journal of Combinatorics 11 (2004) #R14
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66618
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subject68R15; 05A15
dc.titleOn the Entropy and Letter Frequencies of Ternary Square-Free Words
dc.typetext

Files

Collections

arXiv