Richard, Christoph and Grimm, Uwe
(2004).
![[img]](http://oro.open.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (349kB) |
| Google Scholar: | Look up in Google Scholar |
|---|
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.
| Item Type: | Article |
|---|---|
| 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/School: | Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics Faculty of Science, Technology, Engineering and Mathematics (STEM) |
| Item ID: | 5835 |
| Depositing User: | Users 13 not found. |
| Date Deposited: | 09 Nov 2006 |
| Last Modified: | 29 Nov 2016 21:18 |
| URI: | http://oro.open.ac.uk/id/eprint/5835 |
| 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.