Characterization of shuffle squares among doubly binary words
Characterize which doubly binary words—equivalently, binary $C^1$-words whose runs have length at most two—are shuffle squares, thereby resolving the full characterization problem beyond the finite-differentiability subclasses addressed in the paper.
References
In its expanded version, the authors study prefixes of the Kolakoski word and formulate Problem 1 concerning the characterization of shuffle squares among doubly binary words. This problem motivated the present investigation. Although we do not resolve it in full, we obtain partial answers for several natural subclasses and determine exactly which prefixes of the Kolakoski word are shuffle squares.
— Shuffle Squares in Differentiable Words
(2610.07828 - Zwierzyński, 6 Oct 2026) in Introduction, discussion of Problem 1; see also Section 3, paragraph preceding Definition 3.8