{
  "id": "math/9908099",
  "version": "v1",
  "published": "1999-08-19T10:43:25.000Z",
  "updated": "1999-08-19T10:43:25.000Z",
  "title": "The Littlewood-Richardson rule, and related combinatorics",
  "authors": [
    "Marc A. A. van Leeuwen"
  ],
  "comment": "29 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section relating these fairly modern techniques to earlier work on the Littlewood-Richardson rule.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-08-19T10:43:25.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E05",
      "05E10"
    ],
    "keywords": [
      "littlewood-richardson rule",
      "related combinatorics",
      "combinatorial constructions",
      "dual equivalence",
      "coplactic operations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 29,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1999math......8099V"
    }
  }
}