Chromatic Zeros on the Limit of the Family of Hierarchical Graphs
arXiv:2511.10405 · doi:10.1016/j.aop.2026.170509
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 -plane that separates regions of different asymptotic behavior of the -fold iterated RG transformation in the limit. Thus, our results involve calculations of region diagrams in the complex -plane showing the type of behavior that occurs in the limit of the -fold iterated RG transformation mapping starting with the initial value . Calculations are presented of the maximal point at which the locus crosses the real- axis, as well as several other points at which, depending on and , the locus crosses this axis. We give explicit results for a variety of cases and observe a number of interesting features. Calculations of the ground-state degeneracy of the Potts antiferromagnet at are presented. This work extends a previous study with R. Roeder of the case to higher and values.
80 pages, 40 figures