Related papers: Chromatic polynomial and the $\mathfrak{so}$ weigh…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
Recently, using machinery's from Ergodic theory, Z. Lian, and R. Xiao proved if $P$ is any polynomial with no constant term, then for every finite coloring of $\mathbb{N}$, there exists two infinite subsets $B,C$ of $\mathbb{N}$ such that…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…
We study the asymptotic expansion of the colored Jones polynomial (the Melvin-Morton expansion) using a recursion formula for the deframed universal weight system for the $sl(2)$ Lie algebra. Combined with the formula for the universal…
In the theory of finite order knot invariants, the universal $\text{sl}_2$ weight system maps the chord diagrams to polynomials in a single variable with integer coefficients. In this paper, we define a family of polynomials that generalize…
In the present paper, we discuss a way of generalising Vassiliev knot invariants and weight systems to framed chord diagrams having framing 0 and 1.
Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized…
In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give…
DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvo\v{r}\'{a}k and Postle. The chromatic polynomial of a graph is a notion that has been extensively studied since the early 20th century. The chromatic…
We derive general analytic expressions for the chromatic dispersion orders valid to infinity, due to the k vector or phase {\phi} dependence on the wavelength. Additionally, we identify polynomials and recursion relations associated with…
Stanley in his paper [Stanley, Richard P.: Acyclic orientations of graphs In: Discrete Mathematics 5 (1973), Nr. 2, S. 171-178.] provided interpretations of the chromatic polynomial when it is substituted with negative integers. Greene and…
We give necessary and sufficient conditions for a weight system on multiloop chord diagrams to be obtainable from a metrized Lie algebra representation, in terms of a bound on the ranks of associated connection matrices. Here a multiloop…
This note is dedicated to the study of a Hopf module structures on the space of framed chord diagrams and framed graphs. We also introduce a framed version of the chromatic polynomial and propose two methods to construct framed weight…
We prove that the algebra $\cal{A}$ of chord diagrams, the dual to the associated graded algebra of Vassiliev knot invariants, is isomorphic to the universal enveloping algebra of a Casimir Lie algebra in a certain tensor category (the PROP…
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 have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…
DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was…
Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge…