Tangles with up to Seven Crossings (Q3044124)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2086078
Language Label Description Also known as
default for all languages
No label defined
    English
    Tangles with up to Seven Crossings
    scientific article; zbMATH DE number 2086078

      Statements

      Tangles with up to Seven Crossings (English)
      0 references
      0 references
      0 references
      0 references
      10 August 2004
      0 references
      knot
      0 references
      link
      0 references
      double of a tangle
      0 references
      Jones polynomial
      0 references
      The authors assemble a complete table of prime tangles of two strings (including those with closed loops) with up to seven crossings. Two tangles \(T\) and \(T'\) in the table are equivalent if there is a homeomorphism of the 3-ball that takes \(T\) to \(T'\). (Thus there is no restriction that the endpoints of the arcs remain fixed.) Constructing the table can be divided into two parts. First, one assembles the different diagrams. This is done by looking at disk graphs which are similar to graphs of knots, which originate from the checkerboard coloring of knot diagrams. For small numbers of vertices all such graphs are collected. Secondly, one has to prove that the tangle diagrams arising from these graphs are distinct. The main tools to distinguish the tangle diagrams are the Jones polynomial of the double of a tangle [\textit{T. Kanenobu}, Kobe J. Math. 19, No.1--2, 1--19 (2002; Zbl 1040.57006); \textit{V. F. R. Jones}, Ann. Math. (2) 126, 335--388 (1987; Zbl 0631.57005)], and the Krebes invariant [\textit{D. A. Krebes}, J. Knot Theory Ramifications 8, No. 3, 321--352 (1999; Zbl 0941.57012)]. As a Corollary one obtains that there is only one non-alternating prime tangle with a crossing number less or equal to seven.
      0 references

      Identifiers