{
  "id": "1109.2952",
  "version": "v4",
  "published": "2011-09-13T23:49:31.000Z",
  "updated": "2012-05-02T04:23:52.000Z",
  "title": "Upper bound on distance in the pants complex",
  "authors": [
    "Harriet H. Moser"
  ],
  "comment": "A different method is used to find an upper bound on the diameter of the orbit graph, giving a smaller upper bound. Also, distance within an orbit is now calculated in a different orbit",
  "categories": [
    "math.GT"
  ],
  "abstract": "The purpose of this paper is to establish an upper bound on the distance between two pants decompositions in the pants complex for a closed surface of genus g >= 2. This is done by use of graph theory. First distance is found in the pants graph modulo the action of the mapping class group, and then between pants decompositions within an orbit of this action.",
  "revisions": [
    {
      "version": "v4",
      "updated": "2012-05-02T04:23:52.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M50",
      "57M15"
    ],
    "keywords": [
      "pants complex",
      "upper bound",
      "pants decompositions",
      "pants graph modulo",
      "graph theory"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1109.2952M"
    }
  }
}