Answers are grounded in this paper and cite their sources.
One of the main applications of the Jones polynomial invariant of oriented links has been in understanding links with (reduced, connected) alternating diagrams [2], [8], [9]. The Jones polynomial for such a link is never trivial, and the number of crossings in such a diagram is the crossing-number of the link (that is, no diagram of the link has fewer crossings). Here, the non-triviality of the Jones polynomial is established for a wider class of links that includes most pretzel links and the Whitehead double of any alternating knot. The idea of a semi-alternating link is defined and for such a link the crossing-number is determined. Finally, the crossing-number of any Montesinos link is found. That determination uses both the polynomial of Jones and its two-variable semioriented generalisation (due to Kauffman); it is shown that the latter polynomial is never trivial for a Montesinos knot.
No takes yet. Share an insight, caveat, or question.
Lickorish et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: