Related papers: The HOMFLY-PT polynomial is fixed-parameter tracta…
We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires…
Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are…
The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov…
The Homflypt and Kauffman skein modules of the projective space are computed. Both are free and generated by some infinite set of links. This set may be chosen to be L_n, where L_n is an arbitrary link consisting of n projective lines for…
We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…
This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, Kaufman two-variable polynomial, and Khovanov polynomial.
Khovanov homology is a recently introduced invariant of oriented links in $\mathbb{R}^3$. It categorifies the Jones polynomial in the sense that the (graded) Euler characteristic of the Khovanov homology is a version of the Jones polynomial…
We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…
Recent results of J.Gu and H.Jockers provide the lacking initial conditions for the evolution method in the case of the first non-trivially colored HOMFLY polynomials H_{[21]} for the family of twist knots. We describe this application of…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
We explain how existing results (such as categorical sl(n) actions, associated braid group actions and infinite twists) can be used to define a triply graded link invariant which categorifies the HOMFLY polynomial of links coloured by…
For $D$ a reduced alternating surface link diagram, we bound the twist number of $D$ in terms of the coefficients of a polynomial invariant. To this end, we introduce a generalization of the homological Kauffman bracket defined by Krushkal.…
We introduce the deformed fermionic numbers, corresponding to the skein relations, the main characteristics of knots and links. These fermionic numbers allow one to restore the skein relations. For the Alexander (Jones) skein relation we…
We generalize the recently discovered planar decomposition (Kauffman bracket) for the HOMFLY polynomials of bipartite knot/link diagrams to (anti)symmetrically colored HOMFLY polynomials. Cabling destroys planarity, but it is restored after…
We define reduced colored sl(N) link homologies and use deformation spectral sequences to characterize their dependence on color and rank. We then define reduced colored HOMFLY-PT homologies and prove that they arise as large N limits of…
If a knot is represented by an m-strand braid, then HOMFLY polynomial in representation R is a sum over characters in all representations Q\in R^{\otimes m}. Coefficients in this sum are traces of products of quantum R-matrices along the…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
The Jones polynomial $V_{L}(t)$ for an oriented link $L$ is a one-variable Laurent polynomial link invariant discovered by Jones. For any integer $n\ge 3$, we show that: (1) the difference of Jones polynomials for two oriented links which…
Given a directed graph $G$ and a list $(s_1,t_1),\dots,(s_d,t_d)$ of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of $G$ that contains a directed $s_i\to t_i$ path for every $1\le i \le k$. The…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…