| dc.contributor.author | Currie, James | |
| dc.contributor.author | Rampersad, Narad | |
| dc.contributor.author | Aberkane, Ali | |
| dc.date.accessioned | 2019-11-27T21:26:19Z | |
| dc.date.available | 2019-11-27T21:26:19Z | |
| dc.date.issued | 2004-06-19 | |
| dc.identifier.citation | Journal of Integer Sequences, Vol. 7 (2004), Article 04.2.7 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10680/1751 | |
| dc.description.abstract | We show that the number of ternary words of length n avoiding abelian cubes grows
faster than r^n, where r = 2^{1/24} | en_US |
| dc.description.sponsorship | NSERC | en_US |
| dc.description.uri | cs.uwaterloo.ca/journals/JIS/VOL7/Currie/currie18.pdf | en_US |
| dc.language.iso | en | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | combinatorics on words, non-repetitive words, Abelian cubes, decision procedure, enumeration | en_US |
| dc.title | The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | cs.uwaterloo.ca/journals/JIS/VOL7/Currie/currie18.pdf | en_US |
