paper

Asymptotic Limits and Zeros of Chromatic Polynomials and Ground State Entropy of Potts Antiferromagnets

arXiv:cond-mat/9612249 · doi:10.1103/PhysRevE.55.5165

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 family. Using the connection of with the zero-temperature Potts antiferromagnet, we derive a theorem concerning the maximal finite real point of non-analyticity in , denoted and apply this theorem to deduce that and for the square and honeycomb lattices. Finally, numerical calculations of and are presented and compared with series expansions and bounds.

33 pages, Latex, 5 postscript figures, published version; includes further comments on large-q series

References in corpus (9)

Cited by in corpus (71)