{
  "id": "1910.00299",
  "version": "v1",
  "published": "2019-10-01T10:54:30.000Z",
  "updated": "2019-10-01T10:54:30.000Z",
  "title": "Enumerative combinatorics of intervals in the Dyck pattern poset",
  "authors": [
    "Antonio Bernini",
    "Matteo Cervetti",
    "Luca Ferrari",
    "Einar Steingrimsson"
  ],
  "comment": "14 pages, 3 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations. In most of the cases, we are also able to refine our formulas by rank. We also provide the first results on the M\\\"obius function of the Dyck pattern poset, giving for instance a closed expression for the M\\\"obius function of initial intervals whose maximum is a Dyck path having exactly two peaks.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-10-01T10:54:30.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "dyck pattern poset",
      "enumerative combinatorics",
      "specific intervals",
      "first results",
      "initial intervals"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}