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

Type A Demazure atoms are pieces of Schur functions, or sets of tableaux whose weights sum to such functions. Inspired by colored vertex models of Borodin and Wheeler, we will construct solvable lattice models whose partition functions are…

We describe a novel Yang-Baxter integrable vertex model. From this vertex model we construct a certain class of partition functions that we show are equal to the LLT polynomials of Lascoux, Leclerc, and Thibon. Using the vertex model…

We construct an integrable colored six-vertex model whose partition function is a double Grothendieck polynomial. This gives an integrable systems interpretation of bumpless pipe dreams and recent results of Weigandt [arXiv:2003.07342]…

In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…

In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra $U_q \big( \widehat{\mathfrak{sl}} (1 | n)…

Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…

Lascoux stated that the type A Kostka-Foulkes polynomials K_{lambda,mu}(t) expand positively in terms of so-called atomic polynomials. For any semisimple Lie algebra, the former polynomial is a t-analogue of the multiplicity of the dominant…

This is the first in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

For a particular set of Boltzmann weights and a particular boundary condition for the six vertex model in statistical mechanics, we compute explicitly the partition function and show it to be equal to a factorial Schur function, giving a…

Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…

Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…

In this paper, we introduce a class of colored stochastic vertex models with U-turn right boundary. The vertex weights in the models satisfy the Yang-Baxter equations and the reflection equation. Based on these equations, we derive…

We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…

A multi-component electron model on a lattice is constructed whose ground state exhibits a spontaneous ordering which follows the rule of map-coloring used in the solution of the four color problem. The number of components is determined by…

A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…

We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…

In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored…

In this paper we consider coloring problems on graphs and other combinatorial structures on standard Borel spaces. Our goal is to obtain sufficient conditions under which such colorings can be made well-behaved in the sense of topology or…

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…

In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the…