A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989)

Summary: We solve a problem of \textit{E. A. Petrova} [Electron. J. Comb. 23, No. 1, Research Paper P1.18, 12 p. (2016; Zbl 1337.68218)], 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\) and (3) show that the number of ternary square-free words of length \(n\) avoiding letter pattern \(xyzxzyx\) grows exponentially with \(n\).