{
  "id": "0901.2557",
  "version": "v1",
  "published": "2009-01-16T19:36:51.000Z",
  "updated": "2009-01-16T19:36:51.000Z",
  "title": "On the rotation distance between binary trees",
  "authors": [
    "Patrick Dehornoy"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at distance 2n - O(sqrt(n)).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-01-16T19:36:51.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C12",
      "20F38",
      "52B20"
    ],
    "keywords": [
      "binary trees",
      "rotation distance",
      "combinatorial methods",
      "flip distance"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}