Related papers: Spanning trees and Khovanov homology
Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…
We construct an endomorphism of the Khovanov invariant to prove H-thinness and pairing phenomena of the invariants for alternating links. As a consequence, it follows that the Khovanov invariant of an oriented nonsplit alternating link is…
The working mathematician fears complicated words but loves pictures and diagrams. We thus give a no-fancy-anything picture rich glimpse into Khovanov's novel construction of `the categorification of the Jones polynomial'. For the same low…
We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow's homological definition of the Jones polynomial and Kauffman's definition of the Jones polynomial.…
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…
Let K in S^3 be a knot, and let \widetilde{K} denote the preimage of K inside its double branched cover, \Sigma(K). We prove, for each integer n > 1, the existence of a spectral sequence from Khovanov's categorification of the reduced…
We introduce an invariant of tangles in Khovanov homology by considering a natural inverse system of Khovanov homology groups. As application, we derive an invariant of strongly invertible knots; this invariant takes the form of a graded…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
We compare eight versions of finite-dimensional categorifications of the colored Jones polynomial and show that they yield isomorphic results over a field of characteristic zero. As an application, we verify a physics-motivated conjectural…
Given a multiparameter filtration of simplicial complexes, we consider the problem of explicitly constructing generators for the multipersistent homology groups with arbitrary PID coefficients. We propose the use of spanning trees as a tool…
Khovanov homology is a categorification of the Jones polynomial, so it may be seen as a kind of quantum invariant of knots and links. Although polynomial quantum invariants are deeply involved with Vassiliev (aka. finite type) invariants,…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
In this paper we compute the signature for a family of knots $W(k,n)$, the weaving knots of type $(k,n)$. By work of E.~S.~Lee the signature calculation implies a vanishing theorem for the Khovanov homology of weaving knots. Specializing to…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
X.S. Lin and O. Dasbach proved that the sum of the absolute value of the second and penultimate coefficients of the Jones polynomial of an alternating knot is equal to the twist number of the knot. In this paper we give a new proof of their…
A second part of detailed elementary introduction into Khovanov homologies. This part is devoted to reduced Jones superpolynomials. The story is still about a hypercube of resolutions of a link diagram. Each resolution is a collection of…
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…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…