Representing Permutations with Few Moves

Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call…