Reinforcement Learning the Chromatic Symmetric Function
Combinatorics
2024-10-28 v1 Machine Learning
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.
Keywords
Cite
@article{arxiv.2410.19189,
title = {Reinforcement Learning the Chromatic Symmetric Function},
author = {Gergely Bérczi and Jonas Klüver},
journal= {arXiv preprint arXiv:2410.19189},
year = {2024}
}