Two equal-pair deletions for binary words with runs of length at most three
Determine whether two deletions of adjacent equal-letter pairs suffice to transform every even-Parikh binary word whose runs have length at most three into a shuffle square.
References
It is natural to ask whether two such deletions suffice for every even-Parikh word with run lengths at most $3$. The results above do not settle this question.
— Shuffle Squares in Differentiable Words
(2610.07828 - Zwierzyński, 6 Oct 2026) in Remark 5.6, Section 5.3, “Completion at the endpoint and longer runs”