Related papers: On computational complexity of Khovanov homology
Khovanov homology is a bigraded Z-module that categorifies the Jones polynomial. The support of Khovanov homology lies on a finite number of slope two lines with respect to the bigrading. The Khovanov width is essentially the largest…
Khovanov homology is a powerful invariant of oriented links that categorifies the Jones polynomial. Nevertheless, computing Khovanov homology of a given link remains challenging in general with current techniques. In this work we focus on…
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…
In "Homfly polynomial via an invariant of colored plane graphs", Murakami, Ohtsuki, and Yamada provide a state-sum description of the level $n$ Jones polynomial of an oriented link in terms of a suitable braided monoidal category whose…
We adapt Bar-Natan's scanning algorithm for fast computations in (even) Khovanov homology to odd Khovanov homology. We use a mapping cone construction instead of a tensor product, which allows us to deal efficiently with the more…
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…
Given a link or a tangle diagram, we define algorithmic Morse theoretic simplifications on their Khovanov homology. In contrast to Bar-Natan's scanning algorithm, the cancellations are postponed until the end and performed in one go.…
The standard methods for calculating Khovanov homology rely either on long exact/spectral sequences or on the algorithmic "divide and conquer" approach developed by Bar-Natan. In this paper, we employ an alternative and arguably simpler…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
We show a spectral sequence for the rational Khovanov homology of an oriented link in terms of the rational Khovanov complexes and homologies of the link surgeries along an admissible cut. As a non trivial corollary, we give an explicit…
Our main result has topological, combinatorial and computational flavor. It is motivated by a fundamental conjecture stating that computing Khovanov homology of a closed braid of fixed number of strands has polynomial time complexity. We…
Khovanov homology is a topological knot invariant that categorifies the Jones polynomial, recognizes the unknot, and is conjectured to appear as an observable in $4D$ supersymmetric Yang--Mills theory. Despite its rich mathematical and…
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
Khovanov homology offers a nontrivial generalization of Jones polynomial of links in R^3 (and of Kauffman bracket skein module of some 3-manifolds). In this chapter (Chapter X) we define Khovanov homology of links in R^3 and generalize the…
A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only…
In the first part of the Thesis, we reformulate the Murakami-Ohtsuki-Yamada state-sum description of the level n Jones polynomial of an oriented link in terms of a suitable braided monoidal category whose morphisms are Q[q, q-1] s-linear…
We prove the conjecture of Przytycki and Sazdanovic that the Khovanov homology of the closure of a 3-stranded braid only contains torsion of order 2. This conjecture has been known for six out of seven classes in the Murasugi-classification…
We prove a complexity dichotomy theorem for counting planar graph homomorphisms of domain size 3. Given any 3 by 3 real valued symmetric matrix $H$ defining a graph homomorphism from all planar graphs $G \mapsto Z_H(G)$, we completely…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\xi_std), we associate a corresponding multi-pointed nice…