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

Let G be a plane graph with outer cycle C, let u,v be vertices of C and let (L(x):x in V(G)) be a family of sets such that |L(u)|=|L(v)|=2, L(x) has at least three elements for every vertex x of C-{u,v} and L(x) has at least five elements…

We extend the definition of the refined topological vertex C to an n-coloured refined topological vertex C_n that depends on n free bosons, and compute the 5D strip partition function made of N pairs of C_n vertices and conjugate C*_n…

An approach of using RGB-tilings for proving the Four Color Theorem discussed in three previous work is expanded in this paper. A novel methodology and revisions for the methodology in the three aforementioned papers are discussed, and a…

In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…

Using the Gr\"obner basis of an ideal generated by a family of polynomials we prove that every planar graph is 4-colorable. Here we also use the fact that the complete graph of 5 vertices is not included in any planar graph.

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…

We introduce a deformation of the affine Hecke algebra of type GL which describes the commutation relations of the divided difference operators found by Lascoux and Schutzenberger and the multiplication operators. Making use of its…

We will describe solvable lattice models whose partition functions depend on two sets of variables, $x_1,\cdots,x_n$ and $y_1, y_2, \cdots $ that have different connections with the representation theory of $\text{GL}(n,F)$ where $F$ is a…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

Steingrimsson's coloring complex and Jonsson's unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear…

Given a graph $G$, the $k$-coloring graph $\mathcal{C}_k(G)$ is constructed by selecting proper $k$-colorings of $G$ as vertices, with an edge between two colorings if they differ in the color of exactly one vertex. The number of vertices…

We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…

In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…

Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…

To investigate the degree $d$ connectedness locus, Thurston studied \emph{$\sigma_d$-invariant laminations}, where $\sigma_d$ is the $d$-tupling map on the unit circle, and built a topological model for the space of quadratic polynomials…

Given the integral lattice $\Lambda^d$ in $d$-dimensional Euclidean space, partitions of the lattice nodes into orbits of finite-index subgroups of $Aut(\Lambda^d)$ have been computed for $d \leq 4$. These partitions can be interpreted as…

Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…

Developing robust representations of chemical structures that enable models to learn topological inductive biases is challenging. In this manuscript, we present a representation of atomistic systems. We begin by proving that our…

We examine and present new combinatorics for the Schur polynomials from the viewpoint of quantum integrability. We introduce and analyze an integrable six-vertex model which can be viewed as a certain degeneration model from a t-deformed…