Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Knot polynomial


 

Knot theory

This article needs cleanup.
This article needs to be edited to conform to a higher standard of article quality. After the article has been cleaned up, you may remove this message. For help, see How to Edit a Page and the style and How-to Directory . (add new)

A knot polynomial is a particular knot invariant. The coefficients are the important part; the polynomial is not meant to be evaluated, but merely a way of indexing a set of numbers.

"Polynomial" is used in a much more general sense than is usual. As functions in x, these are actually Laurent polynomials in x1/n for various n.

1 Justification

Why bother? For one thing, a polynomial is much easier to communicate than a knot, or even a drawing of a knot.

For another, it's far easier to compare two polynomials for equivalence than two knots. If the knot-to-polynomial mapping can be calculated from elements of the knot and is sufficiently discriminating, two complicated knots can be checked for identity algorithmically.

The latter condition is the harder to satisfy.

Of course polynomials are not the only things available; another hash on a knot is the least number of crossings needed in a diagram of it. But that does not discriminate knots at all well. Another hash is the Fukuhara/O'Hara energy, which discriminate fairly well—an energy E corresponds to at most 0.264×1.658E knots—but is hard to compute.[1] actually it looks like E increases rather rapidly, wrt to crossings, so "rather well" may be optimistic There is also the ropelength[2].

It's also possible that elementary polynomial operations could turn out to have analogues in knot manipulations. Indeed, this is the idea behind skein relations.

2 Alexander polynomial

James W. Alexander invented the first useful knot polynomial in 1923, and published in 1928. Technically, an Alexander polynomial is a generator of a principal Alexander ideal related to the homology of the infinitely cyclic cover of a knot complement—where all the emphasised phrases have particular mathematical meanings. Fortunately there is a shortcut that computes the polynomial from the crossings of an oriented knot.

Procedure, somewhat informally:

1) Number the knot's crossings, 1…N. Prepare an N×N matrix M. (Q: does any ol' diagram do, or does it have to have minimal crossings?)
2) Walk along the knot. As you pass over crossing n, with crossing p on the left and crossing q on the right, add to the matrix:
3) Fill the rest of M with zeros.
4) Drop from M any one row and any one column.
5) Take the determinant of M (this is an Alexander polynomial of the knot).
6) Normalise by dropping all the zero roots and, if the highest-degree coefficient is negative, negating.

The result is ‘the’ Alexander polynomial of the knot.

2.1 Example

On a trefoil knot:

knotcrossings
npq
123
231
312
resulting in the matrix
Take the minor M23


trefoil:


Read more »

Non User