Related papers: Strong spatial mixing of $q$-colorings on Bethe la…
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise…
We study the strong spatial mixing (decay of correlation) property of proper $q$-colorings of random graph $G(n, d/n)$ with a fixed $d$. The strong spatial mixing of coloring and related models have been extensively studied on graphs with…
Strong spatial mixing (SSM) is a form of correlation decay that has played an essential role in the design of approximate counting algorithms for spin systems. A notable example is the algorithm of Weitz (2006) for the hard-core model on…
Strong spatial mixing (SSM) is an important quantitative notion of correlation decay for Gibbs distributions arising in statistical physics, probability theory, and theoretical computer science. A longstanding conjecture is that the uniform…
We study and classify proper $q$-colorings of the $\mathbb Z^d$ lattice, identifying three regimes where different combinatorial behavior holds: (1) When $q\le d+1$, there exist frozen colorings, that is, proper $q$-colorings of $\mathbb…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
We examine various perspectives on the decay of correlation for the uniform distribution over proper $q$-edge colorings of graphs with maximum degree $\Delta$. First, we establish the coupling independence property when $q\ge 3\Delta$ for…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related…
Some old and new evidence for the existence of the string (planar random surfaces) representation of multicolour QCD are reviewed. They concern the random surface representation of the strong coupling expansion in lattice multicolour gauge…
We study correlation functions of spatially separated static quark-antiquark pairs in (2+1)-flavor QCD in order to investigate onset and nature of color screening at high temperatures. We perform lattice calculations in a wide temperature…
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 explore connections between the phenomenon of correlation decay and the location of Lee-Yang and Fisher zeros for various spin systems. In particular we show that, in many instances, proofs showing that weak spatial mixing on the Bethe…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
The method of q-oscillator lattices, proposed recently in [hep-th/0509181], provides the tool for a construction of various integrable models of quantum mechanics in 2+1 dimensional space-time. In contrast to any one dimensional quantum…
We present an efficient algorithm for computing the partition function of the q-colouring problem (chromatic polynomial) on regular two-dimensional lattice strips. Our construction involves writing the transfer matrix as a product of sparse…
A strong edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper, we determine the exact…
We provide an optimally mixing Markov chain for 6-colorings of the square lattice on rectangular regions with free, fixed, or toroidal boundary conditions. This implies that the uniform distribution on the set of such colorings has strong…
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most $b$ and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for…
Nonlinear Bethe-Heitler process in a bichromatic laser field is investigated using strong-field QED formalism. Symmetry properties of angular distributions of created $e^-e^+$ pairs are analyzed. These properties are showed to be governed…