Related papers: The chromatic polynomial of fatgraphs and its cate…
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…
In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three…
This paper consists of three parts. First, we generalize the Jaeger Formula to express the Kauffman-Vogel graph polynomial as a state sum of the Murakami-Ohtsuki-Yamada graph polynomial. Then, we demonstrate that reversing the orientation…
For each indifference graph, there is an associated regular semisimple Hessenberg variety, whose cohomology recovers the chromatic symmetric function of the graph. The decomposition theorem applied to the forgetful map from the regular…
Tensor models are used nowadays for implementing a fundamental theory of quantum gravity. We define here a polynomial $\mathcal T$ encoding the supplementary topological information. This polynomial is a natural generalization of the…
We use categorical annular evaluation to give a uniform construction of both $\mathfrak{sl}_n$ and HOMFLYPT Khovanov-Rozansky link homology, as well as annular versions of these theories. Variations on our construction yield…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
A categorification of a polynomial link invariant is an homological invariant which contains the polynomial one as its graded Euler characteristic. This field has been initiated by Khovanov categorification of the Jones polynomial. Later,…
For every positive integer $n$ we construct a bigraded homology theory for links, such that the corresponding invariant of the unknot is closely related to the U(n)-equivariant cohomology ring of $\mathbb{CP}^{n-1}$; our construction…
In the cabling procedure for HOMFLY polynomials colored HOMFLY polynomials of a knot are obtained from ordinary HOMFLY of the cabled knot with extra twists added. Thus colored polynomials can be seen as relation between HOMFLYs of cabled…
In the first part of the Thesis, we reformulate the Murakami-Ohtsuki-Yamada state-sum description of the level n Jones polynomial of an oriented link in terms of a suitable braided monoidal category whose morphisms are Q[q, q-1] s-linear…
We prove a generalisation of Bollob\'as' classical result on the asymptotics of the chromatic number of the binomial random graph to the stochastic block model. In addition, by allowing the number of blocks to grow, we determine the…
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…
We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
Khovanov homology, an invariant of links in $\mathbb{R}^3$, is a graded homology theory that categorifies the Jones polynomial in the sense that the graded Euler characteristic of the homology is the Jones polynomial. Asaeda, Przytycki and…
We compare eight versions of finite-dimensional categorifications of the colored Jones polynomial and show that they yield isomorphic results over a field of characteristic zero. As an application, we verify a physics-motivated conjectural…
In analogy with a recursive formula for the HOMFLY-PT polynomial of links given by Jaeger, we give a recursive formula for the graph polynomial introduced by Kauffman and Vogel. We show how this formula extends to the Khovanov-Rozansky…
Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a recurrence relation with respect to the deletion, contraction and extraction of an edge. It generalizes some well-known graph polynomials such as the…
A topological index of a graph $G$ is a real number which is preserved under isomorphism. Extensive studies on certain polynomials related to these topological indices have also been done recently. In a similar way, chromatic versions of…