Related papers: Spanning trees and Khovanov homology
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…
A spanning tree of a properly edge-colored complete graph, $K_n$, is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectured that if $K_{2m}$ is properly $(2m-1)$-edge-colored, then…
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…
The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be shrunk to a tree on the same vertex set. Klimo\v{s}ov\'{a}…
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…
In the cabling procedure for HOMFLY polynomials colored HOMFLY polynomials of a knot are obtained from ordinary HOMFLY of the cabled knot with extra twists added. Thus colored polynomials can be seen as relation between HOMFLYs of cabled…
Khovanov homology is a topological knot invariant that categorifies the Jones polynomial, recognizes the unknot, and is conjectured to appear as an observable in $4D$ supersymmetric Yang--Mills theory. Despite its rich mathematical and…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
We introduce the notion of a Khovanov-Floer theory. Roughly, such a theory assigns a filtered chain complex over Z/2 to a link diagram such that (1) the E_2 page of the resulting spectral sequence is naturally isomorphic to the Khovanov…
We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex. For outerplanar graphs $G$ with faces of arbitrary…
Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…
The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a…
We define a family of formal Khovanov brackets of a colored link depending on two parameters. The isomorphism classes of these brackets are invariants of framed colored links. The Bar-Natan functors applied to these brackets produce…
By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \varrho^{-n} (1+o(1))$, where…
We show that the limiting Khovanov chain complex of any infinite positive braid categorifies the Jones-Wenzl projector. This result extends Lev Rozansky's categorification of the Jones-Wenzl projectors using the limiting complex of infinite…
The computation of Khovanov homology for tangles has significant potential applications, yet explicit computational studies remain limited. In this work, we present a method for computing the Khovanov homology of tangles via an arc…
Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…
Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…
Given any diagram of a link, we define on the cube of Kauffman's states a "2-complex" whose homology is an invariant of the associated framed links, and such that the graded Euler characteristic reproduces the unnormalized Kauffman bracket.…
We construct a new spectral sequence beginning at the Khovanov homology of a link and converging to the Khovanov homology of the disjoint union of its components. The page at which the sequence collapses gives a lower bound on the splitting…