{
  "id": "2410.19189",
  "version": "v1",
  "published": "2024-10-24T22:45:01.000Z",
  "updated": "2024-10-24T22:45:01.000Z",
  "title": "Reinforcement Learning the Chromatic Symmetric Function",
  "authors": [
    "Gergely Bérczi",
    "Jonas Klüver"
  ],
  "categories": [
    "math.CO",
    "cs.LG"
  ],
  "abstract": "We propose a conjectural counting formula for the coefficients of the chromatic symmetric function of unit interval graphs using reinforcement learning. The formula counts specific disjoint cycle-tuples in the graphs, referred to as Eschers, which satisfy certain concatenation conditions. These conditions are identified by a reinforcement learning model and are independent of the particular unit interval graph, resulting a universal counting expression.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-10-24T22:45:01.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C31",
      "68T07"
    ],
    "keywords": [
      "chromatic symmetric function",
      "reinforcement learning",
      "unit interval graph",
      "formula counts specific disjoint cycle-tuples"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}