Related papers: Colored five-vertex models and Lascoux polynomials…

The Hankel determinant representations for the partition function and boundary correlation functions of the six-vertex model with domain wall boundary conditions are investigated by the methods of orthogonal polynomial theory. For specific…

We study the coupling of pairs of reverse plane partitions of the same shape by assigning a certain local interaction between the reverse plane partitions. We show that they are in bijection with a certain Yang-Baxter integrable colored…

A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…

The non-negative integer cocharge statistic on words was introduced in the 1970's by Lascoux and Sch\"utzenberger to combinatorially characterize the Hall-Littlewood polynomials. Cocharge has since been used to explain phenomena ranging…

We consider a two-dimensional bi-layered loop model with a certain interlayer coupling and study its spectrum on a torus. Each layer consists of an $O(n)$ model on a honeycomb lattice with periodic boundary conditions; these layers are…

In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go…

Assume $k$ is a positive integer, $\lambda=\{k_1, k_2, \ldots, k_q\}$ is a partition of $k$ and $G$ is a graph. A $\lambda$-list assignment of $G$ is a $k$-list assignment $L$ of $G$ such that the colour set $\cup_{v\in V(G)}L(v)$ can be…

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…

Given two combinatorial notions $\mathsf{P}_0$ and $\mathsf{P}_1$, can we encode $\mathsf{P}_0$ via $\mathsf{P}_1$. In this talk we address the question where $\mathsf{P}_0$ is 3-coloring of integers and $\mathsf{P}_1$ is product of…

The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…

We apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar five-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams.…

We study the connection between the three-color model and the polynomials $q_n(z)$ of Bazhanov and Mangazeev, which appear in the eigenvectors of the Hamiltonian of the XYZ spin chain. By specializing the parameters in the partition…

We construct colored lattice models whose partition functions represent symplectic and odd orthogonal Demazure characters and atoms. We show that our lattice models are not solvable, but we are able to show the existence of sufficiently…

In this paper, two recursion formulae of chromatic polynomial of a maximal planar graph G are obtained. Moreover, the application of these formulaes to the proof of Four-Color Conjecture is investigated. By using these formulae, the proof…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

P. Kirchberger proved that, for a finite subset $X$ of $\mathbb{R}^{d}$ such that each point in $X$ is painted with one of two colors, if every $d+2$ or fewer points in $X$ can be separated along the colors, then all the points in $X$ can…

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…

Given a simple undirected graph $G=(V,E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each part of the partition such that the chromatic number of the…

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…