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

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.

Background

The paper proves that every even-Parikh binary C1C^1-word, whose runs have length at most two, can be repaired to a shuffle square by deleting an adjacent equal pair within a bounded location near an endpoint. The remark asks whether an analogous uniform repair statement remains true when runs of length three are allowed.

The paper gives the example $12221112$, for which the deletion distance is four and deleting one equal pair from each of its two length-three runs leaves the shuffle square $1212$. Thus the one-pair conclusion fails in this larger class, but the authors leave unresolved whether two adjacent equal-pair deletions always suffice.

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”