{
  "id": "math/0701733",
  "version": "v1",
  "published": "2007-01-25T10:25:47.000Z",
  "updated": "2007-01-25T10:25:47.000Z",
  "title": "Dyck paths with coloured ascents",
  "authors": [
    "Andrei Asinowski",
    "Toufik Mansour"
  ],
  "comment": "14 pages, 11 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon, etc. In some cases enumeration gives new expression for sequences enumerating these structures.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-01-25T10:25:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15"
    ],
    "keywords": [
      "dyck paths",
      "coloured ascents",
      "cases enumeration",
      "convex polygon",
      "combinatorial structures"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007math......1733A"
    }
  }
}