Published online by Cambridge University Press: 24 October 2008
To investigate invariants of links derived from their diagrams, the recent new polynomial invariants of links play important roles. Murasugi6, 7, Kauffman3 and Thistlethwaite 9 independently showed that the number of crossings in a proper connected alternating diagram of a link is the minimal-crossing number of the link and that the writhe of the diagram is invariant. Murasugi 8 also determined the minimal-crossing number of torus links. In 5, Lickorish and Thistlethwaite introduced the concept of an adequate link diagram and showed that the number of crossings in an adequate diagram of a semi-alternating link is the minimal-crossing number of the link. They also determined the minimal-crossing number of almost all Montesinos links. In this paper we show that for some links represented by plats and braids which are not adequate, the numbers of crossings in the diagrams are the minimal-crossing numbers of the links.