Related papers: Spanning trees and Khovanov homology
We describe an invariant of links in the three-sphere which is closely related to Khovanov's Jones polynomial homology. Our construction replaces the symmetric algebra appearing in Khovanov's definition with an exterior algebra. The two…
Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…
The algebra of truncated polynomials A_m=Z[x]/(x^m) plays an important role in the theory of Khovanov and Khovanov-Rozansky homology of links. We have demonstrated that Hochschild homology is closely related to Khovanov homology via…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces 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…
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…
Let G be a graph with vertex set {1,...,n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F form an increasing sequence. Hallam and Sagan showed that the generating…
In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and undirected graphs, therefore the algorithms for undirected…
We describe a bordered version of totally twisted Khovanov homology. We first twist Roberts's type $D$ structure by adding a "vertical" type $D$ structure which generalizes the vertical map in twisted tangle homology. One of the distinct…
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 use categorical annular evaluation to give a uniform construction of both $\mathfrak{sl}_n$ and HOMFLYPT Khovanov-Rozansky link homology, as well as annular versions of these theories. Variations on our construction yield…
We consider two well known constructions of link invariants. One uses skein theory: you resolve each crossing of the link as a linear combination of things that don't cross, until you eventually get a linear combination of links with no…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
Quasi-alternating links are a natural generalization of alternating links. In this paper, we show that quasi-alternating links are "homologically thin" for both Khovanov homology and knot Floer homology. In particular, their bigraded…
Halin conjectured that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. This has recently been proven by the second author. In this paper, we strengthen this result by establishing the…
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…