Abstract
A survey of the knot polynomials Δ k (t) computed at the end of the preceding chapter shows that, for each of them, Δ k (1) = ± 1. A proof that this equation holds for all knot polynomials is the objective of the first section of the present chapter. The survey also substantiates the assertion that all knot polynomials are reciprocal polynomials, i.e., for every knot polynomial Δ k (t), there exists an integer n such that Δ k (t) = t n Δ k (t -1). Thus, if Δ k (t) = c n t n + c n-1 t n-1 +··· + c 0, the coefficients exhibit the symmetry c i = c n-i , i = 0, ··· , n. As was pointed out in Section 3 of Chapter VIII, this property is essential to our conclusion that knots of the same type possess identical polynomials. It is therefore important to close this gap in the theory. The proof that knot polynomials are reciprocal polynomials will be effected in Sections 2 and 3 by introducing the notion of dual group presentations, the crucial examples of which are the over and under presentations of knot groups defined in Chapter VI. It should be emphasized that our arguments apply only to tame knots, and throughout this chapter “knot” always means “tame knot.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Seifert, “Über das Geschlect von Knoten,” Math. Ann. Vol. 110 (1934), pp. 571–592;
G. Torres and R. H. Fox, “Dual Presentations of the Group of a Knot,” Ann. of Math. Vol. 59 (1954), pp. 211–218.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1963 R. H. Crowell and C. Fox
About this chapter
Cite this chapter
Crowell, R.H., Fox, R.H. (1963). Characteristic Properties of the Knot Polynomials. In: Introduction to Knot Theory. Graduate Texts in Mathematics, vol 57. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-9935-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-9935-6_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9937-0
Online ISBN: 978-1-4612-9935-6
eBook Packages: Springer Book Archive