A ternary square-free sequence avoiding factors equivalent to abcacba

From MaRDI portal
Publication:289989

zbMATH Open1337.05002arXiv1603.03059MaRDI QIDQ289989FDOQ289989

James D. Currie

Publication date: 1 June 2016

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

Abstract: We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern xyzxzyx. In fact, we: (1) characterize all the (two-way) infinite ternary square-free words avoiding letter pattern xyzxzyx (2) characterize the lexicographically least (one-way) infinite ternary square-free word avoiding letter pattern xyzxzyx (3) show that the number of ternary square-free words of length n avoiding letter pattern xyzxzyx grows exponentially with n.


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

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



Recommendations




Cites Work






This page was built for publication: A ternary square-free sequence avoiding factors equivalent to \(abcacba\)

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