Related papers: The HOMFLY-PT polynomial is fixed-parameter tracta…
We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specifically to answer the question: Is the FKT algorithm under a…
Following the recent work by T.-H. Chan in [HOMFLY polynomial of some generalized Hopf links, J. Knot Theory Ramif. 9 (2000) 865--883] on reverse string parallels of the Hopf link we give an alternative approach to finding the Homfly…
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…
This note is a write-up of a talk given by the author at the Meeting of the Sociedade Portuguesa de Matematica in July 2012. We describe Jaeger's HOMFLY-PT expansion of the Kauffman polynomial and how to generalize it to other quantum…
In this paper we study $U(N)$ colored HOMFLY-PT polynomials of torus links in the double scaling limit (polynomial variable $q\rightarrow 1$, $N\rightarrow \infty$ keeping $q^N$ fixed). We show that, in this limit, the colored HOMFLY-PT…
We show that the triply graded Khovanov-Rozansky homology of knots and links over a field of positive odd characteristic $p$ descends to an invariant in the homotopy category finite-dimensional $p$-complexes. A $p$-extended differential on…
Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…
Weaving knots $W(p, n)$ of type $(p, n)$ denote an infinite family of hyperbolic knots which have not been addressed by the knot theorists as yet. Unlike the well-known $(p,n)$ torus knots, we do not have a closed-form expression for…
We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…
In this paper, we introduce a new method to prove the Lickorish-Millett type formulae for colored HOMFLY-PT polynomials of links.
Topological nodal line semimetals host stable chained, linked, or knotted line degeneracies in momentum space protected by symmetries. In this paper, we use the Jones polynomial as a general topological invariant to capture the global knot…
One of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic is fixed-parameter tractable on C by linear time parameterised algorithms. An immediate…
In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with…
Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…
Associated with each oriented link is the two variable Homflypt polynomial. The Morton-Franks-Williams (MFW) inequality gives rise to an expression for the Homflypt polynomial with MFW coefficient polynomials. These MFW coefficient…
An elementary introduction to knot theory and its link to quantum field theory is presented with an intention to provide details of some basic calculations in the subject, which are not easily found in texts. Study of Chern-Simons theory…
Fixed-parameter tractable (FPT) algorithms have been successfully applied to many intractable problems -- with a focus on decision and optimization problems. Their aim is to confine the exponential explosion to some parameter, while the…
The pioneering work of Jones and Kauffman unveiled a fruitful relationship between statistical mechanics and knot theory. Recently, Jones introduced two subgroups $\vec{F}$ and $\vec{T}$ of the Thompson groups $F$ and $T$, respectively,…
Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by…
Let $E_{k}^{F}(D)$ be the spectral sequence induced by the oriented cube of resolutions on knot Floer homology. We prove that $E_{2}^{F}(D)$ is a triply graded link invariant whose graded Euler characteristic is the HOMFLY-PT polynomial and…