There are ternary circular square-free words of length n for n ≥ 18

Electronic Journal of Combinatorics

Volumn 9, Issue 1 N, 2002, Pages 1-7

  Currie, James D ^a  

^a UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

Combinatorics on words; Square free words

Indexed keywords

EID: 0038693845     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak & Oliver Riordan, Non-repetitive colorings of graphs, Random Structures and Algorithms 21, Issue 3-4, (2002).
2. Dwight R. Bean, Andrzej Ehrenfeucht & George McNulty, Avoidable Patterns in Strings of Symbols, Pacific J. Math. 85 (1979), 261-294.
3. James D. Currie, Non-repetitive walks in graphs and digraphs, PhD thesis, University of Calgary (1987).
4. James D. Currie, Which graphs allow infinite non-repetitive walks? Discrete Math. 87 (1991), 249-260; MR 92a:05124.
5. James D. Currie, Which graphs allow infinite non-repetitive walks? Discrete Math. 87 (1991), 249-260; MR 92a:05124.
6. James D. Currie & R. Jamie Simpson, Non-repetitive tilings, Electronic Journal of Combinatorics 9(1), R28 (2002).
7. Earl D. Fife, Binary sequences which contain no BBb, Trans. Amer. Math. Soc. 261 (1980), 115-136; MR 82a:05034
8. Earl D. Fife, Binary sequences which contain no BBb, Trans. Amer. Math. Soc. 261 (1980), 115-136; MR 82a:05034
9. M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics and its Applications vol. 17, Addison-Wesley, Reading Mass. (1983).
10. Marston Morse & Gustav A. Hedlund, Symbolic dynamics I, II, Amer. J. Math. 60 (1938), 815-866; 62 (1940) 142; MR 1, 123d.
11. Marston Morse & Gustav A. Hedlund, Symbolic dynamics I, II, Amer. J. Math. 60 (1938), 815-866; 62 (1940) 142; MR 1, 123d.
12. Marston Morse & Gustav A. Hedlund, Symbolic dynamics I, II, Amer. J. Math. 60 (1938), 815-866; 62 (1940) 142; MR 1, 123d.
13. Axel Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana (1906), 1-22.