{
  "annotation_id": "e3804b65-6628-47b0-9e53-3c5efc4dc553",
  "date_created": "2026-02-17T05:53:19.904000Z",
  "date_modified": "2026-02-17T05:53:19.904000Z",
  "file_hash": "72492209e10add8d9ac97cdc0410d58da02a0ddb10983d384c919d0f86832a54",
  "private": false,
  "record": {
    "abstract": "In this paper, we provide an upper bound for the number of one-element commutation classes of a permutation, that is, the number of reduced words in which no commutation can be applied. Using this upper bound, we prove a conjecture that relates the number of reduced words with the number of commutation classes of a permutation.",
    "arxiv_id": "2601.09395",
    "authors": [
      "Ricardo Mamede",
      "Jos\u00e9 Luis Santos",
      "Diogo Soares"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Maximum number of one-element commutation classes of a permutation",
    "url": "https://arxiv.org/abs/2601.09395",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0b981807-f612-4ac3-8fbc-326ba0de1cd3",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}