Related papers: Limit shapes for Domain-Wall (colored) vertex mode…
We study $k$-tilings ($k$-tuples of domino tilings) of the Aztec diamond of rank $m$. We assign a weight to each $k$-tiling, depending on the number of dominos of certain types and the number of "interactions" between the tilings. Employing…
We consider the six-vertex model in an L-shaped domain of the square lattice, with domain wall boundary conditions. For free-fermion vertex weights the partition function can be expressed in terms of some Hankel determinant, or equivalently…
In 1970 Baxter considered the statistical three-coloring lattice model for the case of toroidal boundary conditions. He used the Bethe ansatz and found the partition function of the model in the thermodynamic limit. We consider the same…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
We introduce and study the domain wall boundary partition function of the integrable six-vertex model with triangular boundary. We first formulate the domain wall boundary partition function with triangular boundary by using the $U_q(sl_2)$…
Vertical-arrow fluctuations near the boundaries in the six-vertex model on the two-dimensional $N \times N$ square lattice with the domain wall boundary conditions are considered. The one-point correlation function (`boundary polarization')…
We study the 19-vertex model of Statistical Mechanics in a square with the domain wall boundary condition. Using the minimal set of generating flip actions we build a parametrized dynamic version of the model. For all observed dynamic…
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…
We analyze wavefunctions of the six-vertex model by extending the Izergin-Korepin analysis on the domain wall boundary partition functions. We particularly focus on the case with triangular boundary. By using the $U_q(sl_2)$ $R$-matrix and…
This paper continues the study of a new variant of graph coloring with a connectivity constraint recently introduced by Hsieh et al. [COCOON 2024]. A path in a vertex-colored graph is called conflict-free if there is a color that appears…
The trigonometric six-vertex model with domain wall boundary conditions and one partially reflecting end on a lattice of size $2n\times m$, $m\leq n$, is considered. The partition function is computed using the Izergin-Korepin method,…
We consider vertex coloring of an acyclic digraph $\Gdag$ in such a way that two vertices which have a common ancestor in $\Gdag$ receive distinct colors. Such colorings arise in a natural way when bounding space for various genetic data…
In this note, we consider the six-vertex model with domain wall boundary conditions, defined on a $M\times M$ lattice, in the inhomogeneous case where the partition function depends on 2M inhomogeneities $\lambda_j$ and $\mu_k$. For a…
At the free-fermion point, the six-vertex model with domain wall boundary conditions (DWBC) can be related to the Aztec diamond, a domino tiling problem. We study the mapping on the level of complete statistics for general domains and…
We derive the recursive relations of the partition function for the eight-vertex model on an $N\times N$ square lattice with domain wall boundary condition. Solving the recursive relations, we obtain the explicit expression of the domain…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
Random tilings of very large domains will typically lead to a solid, a liquid, and a gas phase. In the two-phase case, the solid-liquid boundary (arctic curve) is smooth, possibly with singularities. At the point of tangency of the arctic…
We consider the six-vertex model on an $N \times N$ square lattice with the domain wall boundary conditions. Boundary one-point correlation functions of the model are expressed as determinants of $N\times N$ matrices, generalizing the known…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
In this paper, we investigate the $k$-path coloring problem, a variant of vertex coloring arising in the context of integrated circuit manufacturing. In this setting, typical industrial instances exhibit a `tree-like' structure. We exploit…