相关论文: Tutte Polynomials of Tensor Products of Signed Gra…

The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic…

In previous joint work with Frohman and Lofaro a noncommutative generalization of the A-polynomial of a knot was introduced, consisting of a finitely generated ideal of polynomials (the noncommutative A-ideal) in the quantum plane. The…

Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph…

The Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play…

A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…

For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.

The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollob\'as-Riordan polynomial of a ribbon graph associated to one of the link's…

The Tutte polynomial is a well-studied invariant of matroids. The polymatroid Tutte polynomial $\mathcal{J}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In…

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…

For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations…

Given a 4-regular graph $F$, we introduce a binary matroid $M_{\tau}(F)$ on the set of transitions of $F$. Parametrized versions of the Tutte polynomial of $M_{\tau}(F)$ yield several well-known graph and knot polynomials, including the…

Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…

The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…

We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of…

We suggest a new construction for the Quantum Groups - Jones polynomials of torus knots in terms of the PBW theorem of DAHA for any root systems and weights (justified for type A). The main focus is on the DAHA super-polynomials, a stable…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…