Asymptotically half of binary words are shuffle squares
Authors
Xiaoyu He, Logan Post
Abstract
A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as , asymptotically half of all binary words of length are shuffle squares. We prove this conjecture in a strong form, by showing that the number of binary shuffle squares of length is .
