Related papers: Patterns in Khovanov link and chromatic graph homo…
We prove that the Khovanov homology of alternating knots and 2-component links is equal (as a singly graded group) to the singular homology of a certain space of trace- free, binary dihedral representations of the link group. More…
The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…
We show that the generalized Khovanov homology, defined by the second author in the framework of chronological cobordisms, admits a grading by the group $\mathbb{Z}\times\mathbb{Z}_2$, in which all homogeneous summands are isomorphic to the…
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…
By means of Rasmussen's formulation of Khovanov-Rozansky homology originally given over $\mathbb{Q}$ in arXiv:math/0607544, we compare different flavors of $\mathfrak{sl}(n)$ link homology with the link invariants obtained by Kitchloo in…
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.…
Khovanov homology has been the subject of much study in knot theory and low dimensional topology since 2000. This work introduces a Khovanov Laplacian and a Khovanov Dirac to study knot and link diagrams. The harmonic spectrum of the…
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…
These notes cover the lectures of the first named author at 2021 IHES Summer School on "Enumerative Geometry, Physics and Representation Theory" with additional details and references. They cover the definition of Khovanov-Rozansky triply…
There exists a simplified Bar-Natan Khovanov complex for open 2-braids. The Khovanov cohomology of a knot diagram made by gluing tangles of this type is therefore often amenable to calculation. We lift this idea to the level of the…
Motivated by algorithmic applications, Kun, O'Brien, Pilipczuk, and Sullivan introduced the parameter linear chromatic number as a relaxation of treedepth and proved that the two parameters are polynomially related. They conjectured that…
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…
We prove that any link in $S^3$ whose Khovanov homology is the same as that of a Hopf link must be isotopic to that Hopf link. This holds for both reduced and unreduced Khovanov homology, and with coefficients in either $\mathbb{Z}$ or…
This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…
This is an expository paper discussing various versions of Khovanov homology theories, interrelations between them, their properties, and their applications to other areas of knot theory and low-dimensional topology.
We show that colored Khovanov homology detects classes of essential surfaces as a direct analogue of the slope conjectures for the colored Jones polynomial. We do this by identifying certain generators of the colored Khovanov chain complex…
Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…
We introduce a refinement of Bar-Natan homology for involutive links, extending the work of Lobb-Watson and Sano. We construct a new suite of numerical invariants and derive bounds for the genus of equivariant cobordisms between strongly…
The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on…
Crew and Spirklt generalize Stanley's chromatic symmetric function to vertex-weighted graphs. One of the primary motivations for extending the chromatic symmetric function to vertex-weighted graphs is the existence of a deletion-contraction…