On ternary square-free circular words

From MaRDI portal
Publication:612919

zbMATH Open1213.68480arXiv1009.5759MaRDI QIDQ612919FDOQ612919


Authors: Arseny M. Shur Edit this on Wikidata


Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths l except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the K3,3 graph. In addition, our proof implies an exponential lower bound on the number of such circular words of length l and allows one to list all lengths l for which such a circular word is unique up to isomorphism.


Full work available at URL: https://arxiv.org/abs/1009.5759

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (19)





This page was built for publication: On ternary square-free circular words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612919)