The Entropy of Square-Free Words

Simple item page
dc.creatorBaake, Michael
dc.creatorElser, Veit
dc.creatorGrimm, Uwe
dc.date1998-09-08
dc.date.accessioned2026-07-07T04:32:31Z
dc.date.available2026-07-07T04:32:31Z
dc.descriptionFinite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an approximate formula which is asymptotically exact with rapid convergence in the number of letters.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math-ph/9809010
dc.identifierhttp://arxiv.org/abs/math-ph/9809010
dc.identifierMathl. Comput. Modelling 26 (1997) 13--26
dc.identifierdoi:10.1016/S0895-7177(97)00196-9
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/58220
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.titleThe Entropy of Square-Free Words
dc.typetext

Files

Collections

arXiv