相关论文: Chromatic Polynomials, Potts Models and All That

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

We present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, the random cluster model, for arbitrary temperature on $n$-vertex ladder graphs with free, cyclic, and M\"obius…

We report exact calculations of the ground state degeneracy per site (exponent of the ground state entropy) $W(\{G\},q)$ of the $q$-state Potts antiferromagnet on infinitely long strips with specified end graphs for free boundary conditions…

For integer q>1, we derive edge q-colouring models for (i) the Tutte polynomial of a graph G on the hyperbola H_q, (ii) the symmetric weight enumerator of the set of group-valued q-flows of G, and (iii) a more general vertex colouring model…

We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…

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_{\phi:V\to [k]}\prod_{\substack{uv\in E \\ \phi(u)=\phi(v)}}w, \] where…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

Tutte proved that if $G_{pt}$ is a planar triangulation and $P(G_{pt},q)$ is its chromatic polynomial, then $|P(G_{pt},\tau+1)| \le (\tau-1)^{n-5}$, where $\tau=(1+\sqrt{5} \,)/2$ and $n$ is the number of vertices in $G_{pt}$. Here we study…

We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…

We establish two expansions of the Potts model partition function of a graph. One is along the deletions of a graph, a rewritten formula given in Biggs (1977). The other is along the contractions of a graph. Then, we specialize the…

We address the enumeration of properly q-colored planar maps, or more precisely, the enumeration of rooted planar maps M weighted by their chromatic polynomial \chi_M(q) and counted by the number of vertices and faces. We prove that the…

We prove tight upper and lower bounds on the internal energy per particle (expected number of monochromatic edges per vertex) in the anti-ferromagnetic Potts model on cubic graphs at every temperature and for all $q \ge 2$. This immediately…

This paper deals with the location of the complex zeros of the Tutte polynomial for a class of self-dual graphs. For this class of graphs, as the form of the eigenvalues is known, the regions of the complex plane can be focused on the sets…

In this paper we present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, for arbitrary temperature on $n$-vertex strip graphs, of width $L_y=2$ and arbitrary length, of the…

We study quasipolynomials enumerating proper colorings, nowhere-zero tensions, and nowhere-zero flows in an arbitrary CW-complex $X$, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may…

Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…

The distribution of the zeros of the partition function in the complex temperature plane (Fisher zeros) of the two-dimensional Q-state Potts model is studied for non-integer Q. On $L\times L$ self-dual lattices studied ($L\le8$), no Fisher…

We present an analysis of the structure and properties of chromatic polynomials $P(G_{pt,\vec m},q)$ of one-parameter and multi-parameter families of planar triangulation graphs $G_{pt,\vec m}$, where ${\vec m} = (m_1,...,m_p)$ is a vector…

A new algorithm is presented, which allows to calculate numerically the partition function Z_q of the d-dimensional q-state Potts models for arbitrary real values q>0 at any given temperature T with high precision. The basic idea is to…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…