Chromatic Zeros on the Limit $G^{(p,\ell)}_\infty$ of the Family $G^{(p,\ell)}_m$ of Hierarchical Graphs
Shu-Chiuan Chang, Robert Shrock

TL;DR
This paper analyzes the zeros of the chromatic polynomial for a family of hierarchical graphs using a renormalization group approach, revealing complex behavior and critical points in the complex plane.
Contribution
It extends previous work on chromatic zeros to higher parameters, providing explicit calculations and insights into the asymptotic behavior of these zeros for a broad class of graphs.
Findings
Calculated the accumulation set of chromatic zeros in the complex q-plane.
Identified the maximal crossing point q_c and other crossing points of the locus ${\cal B}_q$.
Extended analysis to higher p and l values beyond the (2,2) case.
Abstract
We calculate the continuous accumulation set of zeros of the chromatic polynomial in the limit , on a family of graphs defined such that is obtained from by replacing each edge (i.e., bond) on by paths each of length edges, starting with the tree graph . Our method uses the property that the chromatic polynomial of a graph is equal to the evaluation of the partition function of the -state Potts model, together with (i) the property that can be expressed via an exact closed-form real-space renormalization (RG) group transformation in terms of , where is a rational function of and and (ii) is the locus in the complex…
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Markov Chains and Monte Carlo Methods · Topological and Geometric Data Analysis
