Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)

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.

Background

The paper studies shuffle squares, words whose positions can be partitioned into two subsequences inducing identical words. Doubly binary words, after relabelling the alphabet, coincide with the binary C1C^1-words considered in the paper. The cited earlier work formulated a problem asking for a characterization of shuffle squares among all such words.

The paper resolves the parity criterion for the more restrictive classes C3C^3 and C2C^2, and gives a finite reduction for even-Parikh C1C^1-words. However, it explicitly states that these results do not provide a complete solution for all doubly binary words; in particular, the unbounded odd-ABBA family remains outside the scope of the bounded-threshold results.

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