Related papers: A scanning algorithm for odd Khovanov homology
We define a variant of Khovanov homology for links in thickened disks with multiple punctures. This theory is distinct from the one previously defined by Asaeda, Przytycki, and Sikora, but is related to it by a spectral sequence.…
This paper describes how to compute algorithmically certain twisted signature invariants of a knot $K$ using twisted Blanchfield forms. An illustration of the algorithm is implemented on $(2,q)$-torus knots. Additionally, using satellite…
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O(N) . 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…
This paper develops an efficient algorithm for computing the Euclidean projection onto the top-k-sum constraint, a key operation in financial risk management and matrix optimization problems. Existing projection methods rely on sorting and…
We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…
We determine the algebraic structure underlying the geometric complex associated to a link in Bar-Natan's geometric formalism of Khovanov's link homology theory (n=2). We find an isomorphism of complexes which reduces the complex to one in…
We propose three fast algorithms for solving the inverse problem of the thermoacoustic tomography corresponding to certain acquisition geometries. Two of these methods are designed to process the measurements done with point-like detectors…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
The goal of this paper is to address A. Shumakovitch's conjecture about the existence of $\Z_2$-torsion in Khovanov link homology. We analyze torsion in Khovanov homology of semi-adequate links via chromatic cohomology for graphs which…
The complete next-to-next-to leading order (NNLO) QCD correction matched with next-to-next-to leading logarithm (NNLL) has been studied for Drell-Yan production through spin-2 particle at the Large hadron collider (LHC). We consider generic…
Plamenevskaya defined an invariant of transverse links as a distinguished class in the even Khovanov homology of a link. We define an analog of Plamenevskaya's invariant in the odd Khovanov homology of Ozsv\'ath, Rasmussen, and Szab\'o. We…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
In the present paper, we construct the Khovanov homology theory for virtual links. Besides the direct approach with Z_{2} coefficients we also describe the Khovanov homology for framed links and the Khovanov homology using ``double cover''.…
Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several…
We present an algorithm aimed to recognize if a given tensor is a non-identifiable rank-3 tensor.
We define a link homology theory that is readily seen to be both isomorphic to reduced odd Khovanov homology and fully determined by data impervious to Conway mutation. This gives an elementary proof that odd Khovanov homology is mutation…
We use exponential start time clustering to design faster and more work-efficient parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposition routines with strict restrictions on the diameters of…
In the first few homological gradings, there is an isomorphism between the Khovanov homology of a link and the categorification of the chromatic polynomial of a graph related to the link. In this article, we show that the categorification…
We show that the product of an nx3 matrix and a 3x3 matrix over a commutative ring can be computed using 6n+3 multiplications. For two 3x3 matrices this gives us an algorithm using 21 multiplications. This is an improvement with respect to…