Copy the page URI to the clipboard
Richard, Christoph and Grimm, Uwe
(2004).
Abstract
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.
Viewing alternatives
Download history
Item Actions
Export
About
- Item ORO ID
- 5835
- Item Type
- Journal Item
- ISSN
- 1077-8926
- Extra Information
- Preprint version math.CO/0302302 available from http://arxiv.org.abs.math.CO/0302302
- Keywords
- combinatorics on words; square-free words
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Depositing User
- Users 13 not found.