paper

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs

arXiv:1812.07532 · doi:10.4171/AIHPD/108

Abstract

For a graph , , and a complex number the partition function of the univariate Potts model is defined as \[ {\bf Z}(G;k,w):=\sum_{ϕ:V\to [k]}\prod_{\substack{uv\in E \\ ϕ(u)=ϕ(v)}}w, \] where . In this paper we give zero-free regions for the partition function of the anti-ferromagnetic Potts model on bounded degree graphs. In particular we show that for any and any , there exists an open set in the complex plane that contains the interval such that for any and any graph of maximum degree at most . (Here denotes the base of the natural logarithm.) For small values of we are able to give better results. As an application of our results we obtain improved bounds on for the existence of deterministic approximation algorithms for counting the number of proper -colourings of graphs of small maximum degree.

Some minor changes based on referee comments. Accepted for publication in AIHPD. 22 pages; 2 figures

References in corpus (3)

Cited by in corpus (2)