{
  "id": "0910.1619",
  "version": "v1",
  "published": "2009-10-08T21:56:16.000Z",
  "updated": "2009-10-08T21:56:16.000Z",
  "title": "A direct encoding of Stoimenow's matchings as ascent sequences",
  "authors": [
    "Anders Claesson",
    "Mark Dukes",
    "Sergey Kitaev"
  ],
  "comment": "11 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "In connection with Vassiliev's knot invariants, Stoimenow (1998) introduced certain matchings, also called regular linearized chord diagrams. Bousquet-Melou et al. (2008) gave a bijection from those matchings to unlabeled (2+2)-free posets; they also showed how to encode the posets as so called ascent sequences. In this paper we present a direct encoding of Stoimenow's matchings as ascent sequences. In doing so we give the rules for recursively constructing and deconstructing such matchings.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-10-08T21:56:16.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "ascent sequences",
      "stoimenows matchings",
      "direct encoding",
      "vassilievs knot invariants",
      "regular linearized chord diagrams"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0910.1619C"
    }
  }
}