Search arXivSearch

arXiv · math/0603347

The universal Khovanov link homology theory

Abstract

We determine the algebraic structure underlying the geometric complex associated to a link in Bar-Natan's geometric formalism of Khovanov's link homology theory (n=2). We find an isomorphism of complexes which reduces the complex to one in a simpler category. This reduction enables us to specify exactly the amount of information held within the geometric complex and thus state precisely its universality properties for link homology theories. We also determine its strength as a link invariant relative to the different topological quantum field theories (TQFTs) used to create link homology. We identify the most general (universal) TQFT that can be used to create link homology and find that it is "smaller" than the TQFT previously reported by Khovanov as the universal link homology theory. We give a new method of extracting all other link homology theories (including Khovanov's universal TQFT) directly from the universal geometric complex, along with new homology theories that hold a controlled amount of information. We achieve these goals by making a classification of surfaces (with boundaries) modulo the 4TU/S/T relations, a process involving the introduction of genus generating operators. These operators enable us to explore the relation between the geometric complex and its algebraic structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gad Naot. 2009-05-21. The universal Khovanov link homology theory. https://doi.org/10.2140/agt.2006.6.1863

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

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT