{
  "id": "2307.01912",
  "version": "v1",
  "published": "2023-07-04T20:42:37.000Z",
  "updated": "2023-07-04T20:42:37.000Z",
  "title": "Yay for Determinants!",
  "authors": [
    "Tewodros Amdeberhan",
    "Christoph Koutschan",
    "Doron Zeilberger"
  ],
  "comment": "13 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this {\\it case study}, we hope to show why Sheldon Axler was not just wrong, but {\\em wrong}, when he urged, in 1995: ``Down with Determinants!''. We first recall how determinants are useful in enumerative combinatorics, and then illustrate three versatile tools (Dodgson's condensation, the holonomic ansatz and constant term evaluations) to operate in tandem to prove a certain intriguing determinantal formula conjectured by the first author.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-07-04T20:42:37.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "determinants",
      "constant term evaluations",
      "case study",
      "intriguing determinantal formula",
      "sheldon axler"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}