| dc.contributor.author | Currie, James D. | |
| dc.date.accessioned | 2018-01-15T20:16:46Z | |
| dc.date.available | 2018-01-15T20:16:46Z | |
| dc.date.issued | 2002-10-11 | |
| dc.identifier.citation | Currie, James D. “There are Ternary Circular Square-Free Words of Length n for n ≥ 18.” Electronic Journal of Combinatorics 9(1) (2002): Note #N10. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10680/1346 | |
| dc.description.abstract | There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture of R. J. Simpson. | en_US |
| dc.description.uri | http://www.combinatorics.org/Volume_9/Abstracts/v9i1n10.html | |
| dc.language.iso | en | en_US |
| dc.publisher | The Electronic Journal of Combinatorics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Combinatorics on words | en_US |
| dc.subject | square-free words | |
| dc.title | There are Ternary Circular Square-Free Words of Length n for n ≥ 18 | en_US |
| dc.type | Article | en_US |
