{
  "id": "0806.2787",
  "version": "v1",
  "published": "2008-06-17T13:45:48.000Z",
  "updated": "2008-06-17T13:45:48.000Z",
  "title": "Sorting a Permutation by block moves",
  "authors": [
    "Miklos Bona",
    "Ryan Flynn"
  ],
  "comment": "7 pages",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-06-17T13:45:48.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R05"
    ],
    "keywords": [
      "permutation",
      "block moves necessary",
      "open questions",
      "upper bound",
      "block transpositions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0806.2787B"
    }
  }
}