Related papers: A scanning algorithm for odd Khovanov homology
We introduce and analyse an efficient decoder for the quantum Tanner codes of that can correct adversarial errors of linear weight. Previous decoders for quantum low-density parity-check codes could only handle adversarial errors of weight…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. We propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two…
We compute the reduced Khovanov homology of 3-stranded pretzel links. The coefficients are the integers with the "even" sign assignment. In particular, we show that the only homologically thin, non-quasi-alternating 3-stranded pretzels are…
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 that the order of torsion homology classes in Bar-Natan deformation of Khovanov homology is a lower bound for the unknotting number. We give examples of knots that this is a better lower bound than |s(K)/2|, where s(K) is the…
We propose a new algorithm for tensor decomposition, based on Jennrich's algorithm, and apply our new algorithmic ideas to blind deconvolution and Gaussian mixture models. Our first contribution is a simple and efficient algorithm to…
In a previous paper by the authors, we found some patterns in link diagrams that give rise to torsion elements of order two in their Khovanov homology. In this paper we extend these results by providing new torsion patterns. Many of the…
We introduce an sl(n) homology theory for knots and links in the thickened annulus. To do so, we first give a fresh perspective on sutured annular Khovanov homology, showing that its definition follows naturally from trace…
We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…
We propose an algorithm for rotational sparse coding along with an efficient implementation using steerability. Sparse coding (also called dictionary learning) is an important technique in image processing, useful in inverse problems,…
In this note we present an explicit isomorphism between Khovanov-Rozansky $sl_2$-homology and ordinary Khovanov homology. This result was originally stated in Khovanov and Rozansky's paper \cite{KRI}, though the details have yet to appear…
Computing topological invariants of 3-manifolds is generally intractable, yet specialized algebraic structures can enable efficient algorithms. For Witten-Reshetikhin-Turaev (WRT) invariants of torus bundles, we exploit the non-commutative…
We use a special kind of 2-dimensional extended Topological Quantum Field Theories (TQFTs), so-called open-closed TQFTs, in order to extend Khovanov homology from links to arbitrary tangles, not necessarily even. For every plane diagram of…
We prove a conjecture of Migdail and Wehrli regarding the odd Khovanov cobordism maps associated to knotted spheres. Our key tool is Daemi's plane Floer homology, which we use in place of a Lee deformation. Continuing the analogy with Lee…
We define additional gradings on two generalisations of Khovanov homology (one due to the first author, the other due to the second), and use them to define invariants of various kinds of embeddings. These include invariants of links in…
We use the spanning tree model for Khovanov homology to study Legendrian links. This leads to an alternative proof for Ng's Khovanov bound for the Thurston-Bennequin number and to both a necessary and a sufficient condition for this bound…
Given an special type of triangulation $T$ for an oriented closed 3-manifold $M^3$ we produce a framed link in $S^3$ which induces the same $M^3$ by an algorithm of complexity $O(n^2)$ where $n$ is the number of tetrahedra in $T$ . The…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…