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

For a graph $G=(V,E)$, $k\in \mathbb{N}$, and a complex number $w$ 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 $[k]:=\{1,\ldots,k\}$. 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 $Δ\in \mathbb{N}$ and any $k\geq eΔ+1$, there exists an open set $U$ in the complex plane that contains the interval $[0,1)$ such that ${\bf Z}(G;k,w)\neq 0$ for any $w\in U$ and any graph $G$ of maximum degree at most $Δ$. (Here $e$ 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 $k$ for the existence of deterministic approximation algorithms for counting the number of proper $k$-colourings of graphs of small maximum degree.

No reviews yet.

No comments yet.