The Khovanov width of twisted links and closed 3-braids (Q550553)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Khovanov width of twisted links and closed 3-braids
scientific article

    Statements

    The Khovanov width of twisted links and closed 3-braids (English)
    0 references
    0 references
    0 references
    12 July 2011
    0 references
    For an oriented link \(L\) in the \(3\)-sphere, the Khovanov homology \(\mathrm{Kh}(L)\) of \(L\), introduced by \textit{M. Khovanov} [Duke Math. J. 101, No.~3, 359--426 (2000; Zbl 0960.57005)], is a bigraded \(\mathbb{Z}\)-module with homological grading \(i\) and polynomial (or Jones) grading \(j\) so that \(\mathrm{Kh}(L)=\oplus_{i,j}\mathrm{Kh}^{i,j}(L)\). It is well known that the support of \(\mathrm{Kh}(L)\) lies on a finite number of slope \(2\) lines with respect to the \((i,j)\)-grading. Thus if we set \(\delta=j-2i\), then the \(\delta\)-grading gives \(\mathrm{Kh}(L)=\oplus_\delta \mathrm{Kh}^\delta(L)\). Let \(\delta_{\max}\) and \(\delta_{\min}\) be the maximum and minimum \(\delta\)-gradings where \(\mathrm{Kh}(L)\) is non-trivial. Then the Khovanov width of \(L\) is defined as \(w_{\mathrm{Kh}}(L)=\frac{1}{2}(\delta_{\max}-\delta_{\min})+1\). This width is essentially the largest horizontal distance between two supporting lines. In the paper under review, first, the behavior of the Khovanov width under a replacement of a crossing with a rational tangle is studied. Under a certain condition on the crossing, such a replacement does not change the Khovanov width. Second, the Khovanov width of all closed \(3\)-braids is computed. It has a very simple formula. Also, the Turaev genus of all closed \(3\)-braids is determined up to a maximum additive error of at most \(1\). Finally, for closed \(3\)-braids, the Khovanov width is shown to be equal to the odd Khovanov width.
    0 references
    0 references
    Khovanov width
    0 references
    closed 3-braid
    0 references
    Turaev genus
    0 references
    0 references
    0 references
    0 references