Polynomial graph invariants and the KP hierarchy
Combinatorics
2018-05-16 v2 Mathematical Physics
Algebraic Geometry
Algebraic Topology
math.MP
Abstract
We prove that the generating function for the symmetric chromatic polynomial of all connected graphs satisfies (after appropriate scaling change of variables) the Kadomtsev--Petviashvili integrable hierarchy of mathematical physics. Moreover, we describe a large family of polynomial graph invariants giving the same solution of the KP. In particular, we introduce the Abel polynomial for graphs and show this for its generating function. The key point here is a Hopf algebra structure on the space spanned by graphs and the behavior of the invariants on its primitive space.
Cite
@article{arxiv.1803.09800,
title = {Polynomial graph invariants and the KP hierarchy},
author = {Sergei Chmutov and Maxim Kazarian and Sergey Lando},
journal= {arXiv preprint arXiv:1803.09800},
year = {2018}
}
Comments
Minor corrections