Asymptotic Limits and Zeros of Chromatic Polynomials and Ground State Entropy of Potts Antiferromagnets
Robert Shrock, Shan-Ho Tsai (Institute for Theoretical Physics,, State University of New York at Stony Brook)

TL;DR
This paper investigates the asymptotic behavior and zeros of chromatic polynomials for various graph families, linking these properties to the ground state entropy of Potts antiferromagnets and identifying critical points for different lattices.
Contribution
It provides exact calculations of the limiting function W(G,q), analyzes the zeros of chromatic polynomials, and establishes theorems relating these zeros to physical properties of Potts antiferromagnets.
Findings
Zeros of chromatic polynomials often lie on a unit circle depending on the graph family.
The critical point q_c for the square lattice is 3, and for the honeycomb lattice is (3+√5)/2.
Numerical results align with series expansions and theoretical bounds.
Abstract
We study the asymptotic limiting function , where is the chromatic polynomial for a graph with vertices. We first discuss a subtlety in the definition of resulting from the fact that at certain special points , the following limits do not commute: . We then present exact calculations of and determine the corresponding analytic structure in the complex plane for a number of families of graphs , including circuits, wheels, biwheels, bipyramids, and (cyclic and twisted) ladders. We study the zeros of the corresponding chromatic polynomials and prove a theorem that for certain families of graphs, all but a finite number of the zeros lie exactly on a unit circle, whose position depends on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
