{
  "id": "2207.13043",
  "version": "v1",
  "published": "2022-07-26T17:04:31.000Z",
  "updated": "2022-07-26T17:04:31.000Z",
  "title": "Grammic monoids with three generators",
  "authors": [
    "Christian Choffrut"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Young tableaux are combinatorial objects whose construction can be achieved from words over a finite alphabet by row or column insertion as shown by Schensted sixty years ago. Recently Abram and Reutenauer studied the action the free monoid on the set of columns by slightly adapting the insertion algorithm. Since the number of columns is finite, this action yields a finite transformation monoid. Here we consider the action on the set of rows. We investigate this infinite monoid in the case of a 3 letter alphabet. In particular we show that it is the quotient of the free monoid relative to a congruence generated by the classical Knuth rules plus a unique extra rule.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-07-26T17:04:31.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "grammic monoids",
      "generators",
      "free monoid",
      "finite transformation monoid",
      "unique extra rule"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}