{
  "id": "1402.5898",
  "version": "v1",
  "published": "2014-02-24T17:22:32.000Z",
  "updated": "2014-02-24T17:22:32.000Z",
  "title": "Another bijection for 021-avoiding ascent sequences",
  "authors": [
    "David Callan"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Chen and collaborators give a recursively defined bijection from 021-avoiding ascent sequences to 021-avoiding (aka 132-avoiding) permutations. Here we give an algorithmic bijection from 021-avoiding ascent sequences to Dyck paths. Our bijection does not appear to be closely related to the Chen bijection but, like the Chen bijection, it preserves several interesting statistics.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-02-24T17:22:32.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15"
    ],
    "keywords": [
      "ascent sequences",
      "chen bijection",
      "algorithmic bijection",
      "dyck paths"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.5898C"
    }
  }
}