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

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

Given a graph G (or more generally a matroid embedded in a projective space), we construct a sequence of varieties whose geometry encodes combinatorial information about G. For example, the chromatic polynomial of G (giving at each m>0 the…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…

In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…

Andrews and El Bachraoui recently studied various two-colored integer partitions, including those related to two-colored partitions into distinct parts with constraints and overpartitions. Their work raised questions about the existence of…

We develop the theory of colored bosonic models (initiated by Borodin and Wheeler). We will show how a family of such models can be used to represent the values of Iwahori vectors in the "spherical model" of representations of $GL_r(F)$,…

The orbital bivariate chromatic polynomial, introduced in this article, counts the number of ways to color the vertices of a graph with $\lambda$ colors such that adjacent vertices either receive distinct colors from a set of $\lambda$…

George Andrews and Mohamed El Bachraoui recently explored identities for two-color partitions. In particular, they studied the connection between two-colored partitions and overpartitions. Their proofs were analytical, but they conjectured…

We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…

We define Donaldson-Thomas invariants of Calabi-Yau orbifolds and we develop a topological vertex formalism for computing them. The basic combinatorial object is the orbifold vertex, a generating function for the number of 3D partitions…

We give a new combinatorial description for stable Grothendieck polynomials in terms of subdivisions of Gelfand-Zetlin polytopes. Moreover, these subdivisions also provide a description of Lascoux polynomials. This generalizes a similar…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

A packing $(1^{\ell}, 2^k)$-coloring of a graph $G$ is a partition of $V(G)$ into $\ell$ independent sets and $k$ $2$-packings (whose pairwise vertex distance is at least $3$). The square coloring of planar graphs was first studied by…

We give the first polynomial-time algorithm for coloring vertices of P_5-free graphs with k colors. This settles an open problem and generalizes several previously known results.

We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…

We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

We show that any planar graph $G=(V,E)$ has a 5-coloring such that one color class contains at most $|V|/6$ vertices. In other words, there exists a partition of $V$ into five independent sets $\{V_1, \cdots, V_5\}$ such that $|V_5| \leq…

The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…