No CrossRef data available.
Published online by Cambridge University Press: 24 October 2008
Alexander [1] showed that an oriented link K in S3 can always be represented as a closed braid. Later Markov [5] described (without full details) how any two such representations of K are related. In her book [3], Birman gives an extensive description, with a detailed combinatorial proof of both these results.