Related papers: Fast Khovanov Homology Computations
We show that the Khovanov complex of a rational tangle has a very simple representative whose backbone of non-zero morphisms forms a zig-zag. Furthermore, this minimal complex can be computed quickly by an inductive algorithm. (For example,…
We modify the definition of the Khovanov complex for oriented links in a thickening of an oriented surface to obtain a triply graded homological link invariant with a new homotopical grading.
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
We compute the categorified sl(N) link invariants as defined by Khovanov and Rozansky, for various links and values of N. This is made tractable by an algorithm for reducing tensor products of matrix factorisations to finite rank, which we…
Existing fast algorithms for bilateral and nonlocal means filtering mostly work with grayscale images. They cannot easily be extended to high-dimensional data such as color and hyperspectral images, patch-based data, flow-fields, etc. In…
We define a third grading on Khovanov homology, which is an invariant of annular links but changes by $\pm 1$ under stabilization. We illustrate the use of our computer implementation, and give some example calculations.
Inspired by bordered Floer homology, we describe a type A structure on a Khovanov homology for a tangle, which complements the type D structure in a previous paper. The type A structure is a differential module over a certain algebra. This…
We extend the cobordism based categorification of the virtual Jones polynomial to virtual tangles. This extension is combinatorial and has semi-local properties. We use the semi-local property to prove an applications, i.e. we give a…
In the previous paper we constructed the local system of Khovanov complexes on the Vassiliev space of knots and extended it to the singular locus. In this paper we introduce the definition of the homology theory (local system) of finite…
Two simple "simplicial approximation" tricks are invoked to prove basic results involving (co)-homology with local coefficients.
Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polynomial time algorithm. We investigate polynomial time…
In group representations several inductions given by tensoring with appropriate bimodules may be reconstructed via homology of $G$-posets with $G$-equivariant coefficients. For this purpose, we need various local categories of a finite…
We continue to develop the tensor-algebra approach to knot polynomials with the goal to present the story in elementary and comprehensible form. The previously reviewed description of Khovanov cohomologies for the gauge group of rank N-1=1…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
We refine Khovanov homology in the presence of an involution on the link. This refinement takes the form of a triply-graded theory, arising from a pair of filtrations. We focus primarily on strongly invertible knots and show, for instance,…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
We give a new algorithm computing local system cohomology groups for complexified real line arrangements. Using it, we obtain several conditions for the first local system cohomology to vanish and to be at most one-dimensional, which…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We present a fast algorithm for computing discrete cubical homology of graphs over finite fields with an appropriate characteristic. This algorithm improves on several computational steps compared to constructions in the existing…
Khovanov homology is an invariant for links in the three sphere that categorizes the Jones polynomial. We extend Khovanov's construction to links in 3-manifolds that are connected sums of orientable interval bundles over surfaces. Cutting…