Search arXivSearch

arXiv · 0905.0486

A geometric construction of colored HOMFLYPT homology

Abstract

The aim of this paper is two-fold. First, we give a fully geometric description of the HOMFLYPT homology of Khovanov-Rozansky. Our method is to construct this invariant in terms of the cohomology of various sheaves on certain algebraic groups, in the same spirit as the authors' previous work on Soergel bimodules. All the differentials and gradings which appear in the construction of HOMFLYPT homology are given a geometric interpretation. In fact, with only minor modifications, we can extend this construction to give a categorification of the colored HOMFLYPT polynomial, colored HOMFLYPT homology. We show that it is in fact a knot invariant categorifying the colored HOMFLYPT polynomial and that this coincides with the categorification proposed by Mackaay, Stosic and Vaz.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ben Webster, Geordie Williamson. 2010-09-24. A geometric construction of colored HOMFLYPT homology. https://doi.org/10.2140/gt.2017.21.2557

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Hyperbolic links associated to Hamiltonian subgraphs in simple $3$-polytopes

We build a large family of hyperbolic links with an explicit decomposition of the complement into right-angled hyperbolic polytopes of finite volume. Namely, in a series of papers A.D.Mednykn and A.Yu.Vesnin introduced a construction that for a given right-angled polytope $P$ in geometry $\mathbb L^3$, $\mathbb R^3$, $\mathbb S^3$, $\mathbb L^2\times \mathbb R$, $\mathbb S^2\times \mathbb R$ and a Hamiltonian cycle, theta-subgraph or $K_4$-subgraph $Γ$ in the $1$-skeleton of $P$ builds a geometric $3$-manifold $N(P,Γ)$ with an involution $τ$ such that $N(P,Γ)/\langleτ\rangle\simeq S^3$. The brach set of the corresponding $2$-sheeted branched covering $N(P,Γ)\to S^3$ is a link $C_Γ\subset S^3$ consisting of trivially embedded circles. This construction reformulated in the language of toric topology works for such a subgraph $Γ$ in any simple $3$-polytope $P$ and gives a topological $3$-manifold $N(P,Γ)$. We give a criterion when $S^3\setminus C_Γ$ has a complete hyperbolic structure of finite volume and generalize this criterion to similar links in $3$-manifolds different from $S^3$. We prove that hyperbolic links $C_Γ$ are parametrized by nonselfcrossing Eulerian cycles, Eulerian theta-subgraphs and Eulerian $K_4$-subgraphs in hyperbolic right-angled $3$-polytopes of finite volume in $\mathbb L^3$ with $0$, $2$ or $4$ finite vertices. The complement $S^3\setminus C_Γ$ is glued of $4$, $8$ or $16$ copies of the corresponding right-angled polytope. We give a criterion when the link $C_Γ$ consists of mutually unlinked circles and prove that if such a link is nontrivial, then it contains the Borromean rings. The latter problem is motivated by the Efimov effect in quantum mechanics.

math.GT

More Versions of Real Link Floer Homology

In this paper, we further develop the real link Floer homology defined by the first author. We introduce a new base-pointing convention that leads to a different version of real link Floer homology and show that this new theory is related to the old one by an exact triangle. We also define a real link Floer theory for multi-based strongly invertible links, which is a strong real Heegaard invariant, and take a first step toward a real link Floer TQFT. A computer implementation for the new theory via grid diagrams was written by Zhenkun Li. We also include an appendix containing real grid homology of more than 50 small knots.

math.GT

Knots and the Sierpinski Tetrahedron

In this paper we prove that there are infinitely many knots that cannot be embedded in the 1-skeletons of the finite iterations of the Sierpinski tetrahedron fractal. We do this by proving that such an embedding induces a sphere decomposition of weight at most 6. There are infinitely many knots with spherewidth greater than this.

math.GT