We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.
On the distance between the expressions of a permutation
The distance of a permutation from a subgroup of S_n
Equidistribution of (X,Y)-descents, (X,Y)-adjacent pairs, and (X,Y)-place-value pairs on permutations
![QR code for arXiv:0806.2787 [math.CO]](http://oss.arxitics.com/images/favicon.svg)