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

We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…

We first observe a mysterious similarity between the braid arrangement and the arrangement of all hyperplanes in a vector space over the finite field $\mathbb{F}_q$. These two arrangements are defined by the determinants of the Vandermonde…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

We study the chromatic polynomials for m \times n square-lattice strips, of width 9 <= m <= 13 (with periodic boundary conditions) and arbitrary length n (with free boundary conditions). We have used a transfer matrix approach that allowed…

We calculate complex-temperature (CT) zeros of the partition function for the $q$-state Potts model on the honeycomb and kagom\'e lattices for several values of $q$. These give information on the CT phase diagrams. A comparison of results…

We have studied the ordering of the q-colours Potts model in two dimensions on a square lattice. On the basis of our observations we propose that if q is large enough the system is not able to break global and local null magnetisation…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…

The q-state Potts field theory describes the universality class associated to the spontaneous breaking of the permutation symmetry of q colors. In two dimensions it is defined up to q=4 and exhibits duality and integrability away from…

Statistical models are widely used for the investigation of complex system's behavior. Most of the models considered in the literature are formulated on regular lattices with nearest-neighbor interactions. The models with non-local…

This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…

There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

We consider the robust chromatic number $\chi_1(G)$ of planar graphs $G$ and show that there exists an infinite family of planar graphs $G$ with $\chi_1(G) = 3$, thus solving a recent problem of Bacs\'{o}~et~al. (The robust chromatic number…

The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…

Denoting $P(G,q)$ as the chromatic polynomial for coloring an $n$-vertex graph $G$ with $q$ colors, and considering the limiting function $W(\{G\},q) = \lim_{n \to \infty}P(G,q)^{1/n}$, a fundamental question in graph theory is the…

A complete partition of a graph $G$ is a partition of the vertex set such that there is at least one edge between any two parts. The largest $r$ such that $G$ has a complete partition into $r$ parts, each of which is an independent set, is…

We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…

We study the accumulation of zeros of a polynomial arising from the enumeration of edge-coloured graphs along certain limit curves. The polynomial is a variant of an edge-chromatic polynomial, which specialises to the partition function of…

A topological index of a graph $G$ is a real number which is preserved under isomorphism. Extensive studies on certain polynomials related to these topological indices have also been done recently. In a similar way, chromatic versions of…

The Potts conformal field theory is an analytic continuation in the central charge of conformal field theory describing the critical two-dimensional $Q$-state Potts model. Four-point functions of the Potts conformal field theory are…