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

We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…

We prove that for any graph $G$ the (complex) zeros of its chromatic polynomial, $\chi_G(x)$, lie inside the disk centered at $0$ of radius $4.25 \Delta(G)$, where $\Delta(G)$ denotes the maximum degree of $G$. This improves on a recent…

We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial…

The $U$-polynomial of Noble and Welsh is known to have intimate connections with the Potts model as well as with several important graph polynomials. For each graph $G$, $U(G)$ is equivalent to Stanley's symmetric bad colouring polynomial…

For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

We study the graph coloring problem over random graphs of finite average connectivity $c$. Given a number $q$ of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high…

We exhibit infinite families of two-dimensional lattices (some of which are triangulations or quadrangulations of the plane) on which the q-state Potts antiferromagnet has a finite-temperature phase transition at arbitrarily large values of…

Recently, big data techniques such as machine learning and topological data analysis have made their way to theoretical mathematics. Motivated by the recent work with polynomial invariants for knots, we use manifold learning and topological…

Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…

We study a variant of the ferromagnetic Potts model, recently introduced by Tamura, Tanaka and Kawashima, consisting of a ferromagnetic interaction among $q$ "visible" colours along with the presence of $r$ non-interacting "invisible"…

We show that for $q$-colorings in $k$-uniform hypergraphs with maximum degree $\Delta$, if $k\ge 50$ and $q\ge 700\Delta^{\frac{5}{k-10}}$, there is a "Lee-Yang" zero-free strip around the interval $[0,1]$ of the partition function, which…

A simple graph-product type construction shows that for all natural numbers $r \ge q$, there exists an edge-coloring of the complete graph on $2^r$ vertices using $r$ colors where the graph consisting of the union of arbitrary $q$ color…

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…

We study the chromatic quasisymmetric class function of a linearized combinatorial Hopf monoid. Given a linearized combinatorial Hopf monoid $H$, and an $H$-structure $h$ on a set $N$, there are proper colorings of $h$, generalizing graph…

Let $V$ be a vector space of dimension $v$ over a field of order $q$. The $q$-Kneser graph has the $k$-dimensional subspaces of $V$ as its vertices, where two subspaces $\alpha$ and $\beta$ are adjacent if and only if $\alpha\cap\beta$ is…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

We present exact calculations of the Potts model partition function $Z(G,q,v)$ for arbitrary $q$ and temperature-like variable $v$ on $n$-vertex square-lattice strip graphs $G$ for a variety of transverse widths $L_t$ and for arbitrarily…

We study the phase diagram of the triangular-lattice $Q$-state Potts model in the real $(Q,v)$-plane, where $v=e^J-1$ is the temperature variable. Our first goal is to provide an obviously missing feature of this diagram: the position of…