Related papers: Colored five-vertex models and Lascoux polynomials…
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this…
We introduce a new model of random multigraphs with colored vertices and weighted edges. It is similar to the "inhomogeneous random graph model" of S\"oderberg (2002), extended by Bollob\'as, Janson and Riordan (2007). By means of analytic…
The chromatic number for properly colouring the facets of a combinatorial simple $n$-polytope $P^n$ that is the orbit space of a quasitoric manifold satisfies the inequality $n\leq P^n\leq 2^n-1$. The inequality is sharp for $n=2$ but not…
In this paper, we extend the chromatic symmetric function $X$ to a chromatic $k$-multisymmetric function $X_k$, defined for graphs equipped with a partition of their vertex set into $k$ parts. We demonstrate that this new function retains…
In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of G\"ollnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this…
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
An injective coloring of a graph $G$ is an assignment of colors to the vertices of $G$ so that any two vertices with a common neighbor have distinct colors. A graph $G$ is injectively $k$-choosable if for any list assignment $L$, where…
In this paper we will present a homological model for Coloured Jones Polynomials. For each colour $N \in \mathbb {N}$, we will describe the invariant $J_N(L,q)$ as a graded intersection pairing of certain homology classes in a covering of…
In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…
We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial…
Despite their success in various domains, the growing dependence on GNNs raises a critical concern about the nature of the combinatorial reasoning underlying their predictions, which is often hidden within their black-box architectures.…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
We present an efficient algorithm for computing the partition function of the q-colouring problem (chromatic polynomial) on regular two-dimensional lattice strips. Our construction involves writing the transfer matrix as a product of sparse…
We introduce the notion of a conformal design based on a vertex operator algebra. This notation is a natural analog of the notion of block designs or spherical designs when the elements of the design are based on self-orthogonal binary…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
The primary objectives of this paper are to present the construction of bivariate fractal interpolation functions over triangular interpolating domain using the concept of vertex coloring and to propose a double integration formula for the…
We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.