There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
type: Item
instance of: scholarly article
title: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
zbMATH Open document ID: 1057.68081
author: James D. Currie
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-13T00:00:00Z
full work available at URL: https://eudml.org/doc/124300
full work available at URL: v9i1n10.html
review text: Summary: There are circular square-free words of length \(n\) on three symbols for \(n\geq 18\). This proves a conjecture of R. J. Simpson.
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 1862491
zbMATH Keywords: combinatorics on words
zbMATH Keywords: square-free words
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1862491