On a combinatorial generation problem of Knuth

Arturo Merino, Ondřej Mička, Torsten Mütze

The well-known middle levels conjecture asserts that for every integer $n\ge 1$, all binary strings of length $2(n+1)$ with exactly $n+1$ many 0s and 1s can be ordered cyclically…