Related papers: The HOMFLY-PT polynomial is fixed-parameter tracta…
The HOMFLY-PT polynomial is a link invariant which is effective in determining chiral knot and link types with small crossing numbers. In this chapter, we concentrate on knots. We provide a guide for computing the knot types of…
We give the first known topological model for the HOMFLY-PT polynomial constructed directly from link diagrams. More precisely, we prove that this invariant is given by graded intersections between explicit Lagrangian submanifolds in a…
The Jones problem is a question whether there is a non-trivial knot with the trivial Jones polynomial in one variable $q$. The answer to this fundamental question is still unknown despite numerous attempts to explore it. In braid…
We study factorizations of HOMFLY polynomials of certain knots and oriented links. We begin with a computer analysis of knots with at most 12 crossings, finding 17 non-trivial factorizations. Next, we give an irreducibility criterion for…
The definition of the Jones polynomial in the 80's gave rise to a large family of so-called quantum link invariants, based on quantum groups. These quantum invariants are all controlled by the same two-variable invariant (the HOMFLY-PT…
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…
For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…
We provide a combinatorial characterisation of positive diagrams satisfying the equality in the Morton-Franks-Williams bound for the degrees of the HOMFLY-PT polynomial. This characterisation allows generating with relative ease examples of…
We present a short and unified representation-theoretical treatment of type A link invariants (that is, the HOMFLY-PT polynomials, the Jones polynomial, the Alexander polynomial and, more generally, the gl(m|n) quantum invariants) as link…
Khovanov and Rozansky's categorification of the HOMFLY-PT polynomial is invariant under braidlike isotopies for any link diagram and Markov moves for braid closures. To define HOMFLY-PT homology, they required a link to be presented as a…
The Harer-Zagier (HZ) transform maps the HOMFLY-PT polynomial into a rational function. For some special knots and links, the latter admits a simple factorised form, which is referred to as HZ factorisation. This property is preserved under…
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…
Following the suggestion of arXiv:1407.6319 to lift the knot polynomials for virtual knots and links from Jones to HOMFLY, we apply the evolution method to calculate them for an infinite series of twist-like virtual knots and antiparallel…
Polymers can be modeled as open polygonal paths and their closure generates knots. Knotted proteins detection is currently achieved via high-throughput methods based on a common framework insensitive to the handedness of knots. Here we…
Colored HOMFLY-PT invariant, the generalization of the colored Jones polynomial, is one of the most important quantum invariants of links. This paper is devoted to investigating the basic structures of the colored HOMFLY-PT invariants of…
Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast, graph polynomials which are definable in MSOL on the…
Virtual knots are associated with knot diagrams, which are not obligatory planar. The recently suggested generalization from N=2 to arbitrary N of the Kauffman-Khovanov calculus of cycles in resolved diagrams can be straightforwardly…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
We conjecture a closed-form expression of HOMFLY-PT invariants of double twist knots colored by rectangular Young diagrams where the twist is encoded in interpolation Macdonald polynomials. We also put forth a conjecture of cyclotomic…
Fixed parameter tractable (FPT) algorithms run in time f(p(x)) poly(|x|), where f is an arbitrary function of some parameter p of the input x and poly is some polynomial function. Treewidth, branchwidth, cliquewidth, NLC-width, rankwidth,…