{
  "id": "1809.01340",
  "version": "v1",
  "published": "2018-09-05T06:06:27.000Z",
  "updated": "2018-09-05T06:06:27.000Z",
  "title": "Stack-Sorting, Set Partitions, and Lassalle's Sequence",
  "authors": [
    "Colin Defant",
    "Michael Engen",
    "Jordan A. Miller"
  ],
  "comment": "19 pages, 11 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new combinatorial interpretations of Lassalle's sequence. One of these interpretations involves permutations that have exactly one preimage under the (West) stack-sorting map. We prove that the sequences obtained by counting these permutations according to their first entries are symmetric, and we conjecture that they are log-concave. We also obtain new recurrence relations involving Lassalle's sequence and the sequence that enumerates valid hook configurations. We end with several suggestions for future work.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-09-05T06:06:27.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A19"
    ],
    "keywords": [
      "lassalles sequence",
      "enumerates valid hook configurations",
      "stack-sorting",
      "combinatorial interpretations",
      "recently-introduced combinatorial objects"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}