Some links with non-trivial polynomials and their crossing-numbers (Q1262578)

In this paper, the authors introduce the concept of adequacy for link diagrams, and show that the terms of highest and lowest degrees in the Kauffman's bracket polynomial \(<D>\) of an adequate diagram D are expressed in terms of the crossing number and two specific states \(s_+\) and \(s_-\) for D. It is observed that the following diagrams are adequate: (1) reduced alternating diagrams, (2) parallel diagrams of adequate diagrams, (3) semi-alternating diagrams (that is, non- alternating diagrams which are sums of two strongly alternating tangles), and (4) certain mutants of most Montesinos links. Using these observations, the authors generalize the estimate of the breadth of the Jones polynomial of an alternating link due to Kauffman, Murasugi, and the second author; and obtain the following results: (1) Nontriviality of the Jones polynomial of the untwisted double of a nontrivial knot with an adequate diagram. (2) The breadth of the Jones polynomial of a link with an n-crossing semi-alternating diagram is n-1. (3) Determination of the minimal crossing number of all Montesinos links. In a subsequent work [Invent. Math. 93, 285-296 (1988; Zbl 0645.57007)], the second author proved that if L has an adequate diagram with n-crossings, then it has no diagram with fewer crossings.