Combinatorics / CONCEPT

Diameter of the inverse-closed consecutive 3-cycle Schreier coset graph

For 2 <= L <= N and N > 3, on binary words with L zeros and N - L ones, where a move rotates three consecutive letters one place in either direction, every word can be turned into every other in at most the ceiling of L(N - L)/2 moves, and turning the sorted word 0...01...1 into its reversal needs that many, as conjectured for k = 3 in Conjecture 16 of CayleyPy-4.