English
Related papers

Related papers: On the HOMFLY and Tutte polynomials

200 papers

We continue the program of systematic study of extended HOMFLY polynomials. Extended polynomials depend on infinitely many time variables, are close relatives of integrable tau-functions, and depend on the choice of the braid representation…

High Energy Physics - Theory · Physics 2012-09-11 H. Itoyama , A. Mironov , A. Morozov , An. Morozov

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.

Combinatorics · Mathematics 2009-06-29 Edna F Jasso-Hernandez , Yongwu Rong

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: take as input a graph G, and output a…

Computational Complexity · Computer Science 2008-07-20 Leslie Ann Goldberg , Mark Jerrum

Given a planar curve singularity, we prove a conjecture of Oblomkov-Shende, relating the geometry of its Hilbert scheme of points to the HOMFLY polynomial of the associated algebraic link. More generally, we prove an extension of this…

Algebraic Geometry · Mathematics 2012-10-24 Davesh Maulik

Many knots and links in S^3 can be drawn as gluing of three manifolds with one or more four-punctured S^2 boundaries. We call these knot diagrams as double fat graphs whose invariants involve only the knowledge of the fusion and the…

High Energy Physics - Theory · Physics 2015-07-30 A. Mironov , A. Morozov , An. Morozov , P. Ramadevi , Vivek Kumar Singh

The tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the…

Combinatorics · Mathematics 2014-06-10 Yuanan Diao , Gábor Hetyei

Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…

Combinatorics · Mathematics 2011-03-08 Tamás Kálmán

We calculate Jones polynomials $V(H_r,t)$ for a family of alternating knots and links $H_r$ with arbitrarily many crossings $r$, by computing the Tutte polynomials $T(G_+(H_r),x,y)$ for the associated graphs $G_+(H_r)$ and evaluating these…

Mathematical Physics · Physics 2025-11-11 Yue Chen , Robert Shrock

The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is…

Combinatorics · Mathematics 2020-07-23 Olivier Bernardi , Tamas Kalman , Alex Postnikov

We prove that the colored HOMFLY polynomial of a link, colored by symmetric or exterior powers of the fundamental representation, is q-holonomic with respect to the color parameters. As a result, we obtain the existence of an (a,q)…

Geometric Topology · Mathematics 2012-11-28 Stavros Garoufalidis

It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the braid index of the link and the well known…

Geometric Topology · Mathematics 2016-12-08 Pengyu Liu , Yuanan Diao , Gábor Hetyei

It is well-known that every planar graph has a Tutte path, i.e., a path $P$ such that any component of $G-P$ has at most three attachment points on $P$. However, it was only recently shown that such Tutte paths can be found in polynomial…

Data Structures and Algorithms · Computer Science 2019-03-13 Therese Biedl , Philipp Kindermann

Tutte showed that a graph $G$ is planar if and only if the conflict graph associated to every cycle of $G$ is bipartite. We define a (not necessarily unique) signed conflict graph associated to a maximally planar subgraph of a nonplanar…

Combinatorics · Mathematics 2023-02-28 Joel Foisy

In this paper we discuss an approach to calculate knot polynomials on a photonic processor. Calculations of knot polynomials is a computationally difficult problem and therefore it is interesting to use new advanced calculation methods to…

Quantum Physics · Physics 2024-05-07 Ivan Dyakonov , Ilya Kondratyev , Sergey Mironov , Andrey Morozov

We propose a new, precise integrality conjecture for the colored Kauffman polynomial of knots and links inspired by large N dualities and the structure of topological string theory on orientifolds. According to this conjecture, the natural…

High Energy Physics - Theory · Physics 2014-11-18 Marcos Marino

Polynomial invariants corresponding to the fundamental representation of the gauge group $SO(N)$ are computed for arbitrary torus knots in the framework of Chern-Simons gauge theory making use of knot operators. As a result, a formula which…

q-alg · Mathematics 2009-10-28 J. M. F. Labastida , E. Perez

Hilbert scheme topological invariants of plane curve singularities are identified to framed threefold stable pair invariants. As a result, the conjecture of Oblomkov and Shende on HOMFLY polynomials of links of plane curve singularities is…

Algebraic Geometry · Mathematics 2012-11-13 D. -E. Diaconescu , Z. Hua , Y. Soibelman

We calculate Jones polynomials $V_L(t)$ for several families of alternating knots and links by computing the Tutte polynomials $T(G,x,y)$ for the associated graphs $G$ and then obtaining $V_L(t)$ as a special case of the Tutte polynomial.…

Mathematical Physics · Physics 2009-11-07 Shu-Chiuan Chang , Robert Shrock

We describe the explicit form and the hidden structure of the answer for the HOMFLY polynomial for the figure eight and some other 3-strand knots in representation [21]. This is the first result for non-torus knots beyond (anti)symmetric…

High Energy Physics - Theory · Physics 2014-03-20 A. Anokhina , A. Mironov , A. Morozov , An. Morozov

Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell,…

Computational Complexity · Computer Science 2016-06-22 Cornelius Brand , Holger Dell , Marc Roth