The Open UniversitySkip to content

On the entropy and letter frequencies of ternary square-free words

Richard, Christoph and Grimm, Uwe (2004). On the entropy and letter frequencies of ternary square-free words. Electronic Journal of Combinatorics, 11(1) R14.

Full text available as:
PDF (Not Set) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (341Kb)
Google Scholar: Look up in Google Scholar


We enumerate all ternary length-1 square-free words, which are words avoiding squares of words up to length 1, for 1<=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.

Item Type: Journal Article
ISSN: 1077-8926
Extra Information: Preprint version math.CO/0302302 available from
Keywords: combinatorics on words; square-free words
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 5835
Depositing User: Users 13 not found.
Date Deposited: 09 Nov 2006
Last Modified: 25 Feb 2016 15:38
Share this page:

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340