Sorting a Permutation by block moves
Combinatorics
2008-06-18 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0806.2787,
title = {Sorting a Permutation by block moves},
author = {Miklos Bona and Ryan Flynn},
journal= {arXiv preprint arXiv:0806.2787},
year = {2008}
}
Comments
7 pages