Related papers: A New Polynomial for Checkerboard-Colorable 4-Vale…
Trivalent plane graphs are used in various areas of mathematics which relate for instance to the colored Jones polynomial, invariants of 3-manifolds and quantum computation. Their evaluation is based on computations in the Temperley-Lieb…
We use Kauffman's bracket polynomial to define a complex-valued invariant of virtual rational tangles that generalizes the well-known fraction invariant for classical rational tangles. We provide a recursive formula for computing the…
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…
We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard…
Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…
We define a multi-variable version of the Affine Index Polynomial for virtual links. This invariant reduces to the original Affine Index Polynomial in the case of virtual knots, and also generalizes the version for compatible virtual links…
In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…
A biquandle is a solution to the set-theoretical Yang-Baxter equation, which yields invariants for virtual knots such as the coloring number and the state-sum invariant. A virtual biquandle enriches the structure of a biquandle by…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
In this paper, for each graph $G$, we def\mbox{}ine a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of $G$. Furthermore, we def\mbox{}ine a chain complex…
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…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to…
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…
We construct new invariant polynomial for long virtual knots. It is a generalization of Alexander polynomial. We designate it by $\zeta$ meaning an analogy with $\zeta$-polynomial for virtual links. A degree of $\zeta$-polynomial estimates…
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…
The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the…
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$…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
We define two new invariants for tied links. One of them can be thought as an extension of the Kauffman polynomial and the other one as an extension of the Jones polynomial which is constructed via a bracket polynomial for tied links. These…
This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram…