Related papers: Relative Tutte Polynomials for Colored Graphs and …
We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…
In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…
We define new notions of groups of virtual and welded knots (or links) and we study their relations with other invariants, in particular the Kauffman group of a virtual knot.
A sequence of $F$-polynomials $\{ F^n_K (t, \ell)\}_{n=1}^{\infty}$ of virtual knots $K$ was defined by Kaur, Prabhakar, and Vesnin in 2018. These polynomials have been expressed in terms of index value of crossing and $n$-writhe of $K$. By…
It is known that the colored Jones polynomials of a knot in the 3-dimensional sphere satisfy recursive relations, it is also known that these recursive relations come from recurrence polynomials which have been related, by the AJ…
We establish a relation between the trace evaluation in SO(3) topological quantum field theory and evaluations of a topological Tutte polynomial. As an application, a generalization of the Tutte golden identity is proved for graphs on the…
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…
It has been known since the work of Tutte that the value of the chromatic polynomial of planar triangulations at $(3+\sqrt{5})/2$ has a number of remarkable properties. We investigate to what extent Tutte's relations characterize planar…
The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: given as input a planar graph G,…
Let $t_{i,j}$ be the coefficient of $x^iy^j$ in the Tutte polynomial $T(G;x,y)$ of a connected bridgeless and loopless graph $G$ with order $n$ and size $m$. It is trivial that $t_{0,m-n+1}=1$ and $t_{n-1,0}=1$. In this paper, we obtain…
The Bollob\'as-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
The total face color polynomial is based upon the Poincar\'{e} polynomials of a family of filtered $n$-color homologies. It counts the number of $n$-face colorings of ribbon graphs for each positive integer $n$. As such, it may be seen as a…
For virtual knot theory, the virtual braid group was defined by generalizing the braid group. It was proved that any virtual link can be obtained by the closure of a virtual braid. On the other hand, due to work by Jones et al., it is known…
We construct graph-valued analogues of the Kuperberg sl(3) and G2 invariants for virtual knots. The restriction of the sl(3) or G2 invariants for classical knots coincides with the usual Homflypt sl(3) invariant and G2 invariants. For…
We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability…