Abstract
Cassaigne conjectured in 1994 that any pattern with m distinct variables of length at least 3(2m−1) is avoidable over a binary alphabet, and any pattern with m distinct variables of length at least 2m is avoidable over a ternary alphabet. Building upon the work of Rampersad and the power series techniques of Bell and Goh, we obtain both of these suggested strict bounds. Similar bounds are also obtained for pattern avoidance in partial words, sequences where some characters are unknown.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have