Braids, Links, and Mapping Class Groups is organized into five chapters and an appendix. The first introductory chapter defines braid groups, configuration spaces, and the use of configuration spaces to define braid groups on arbitrary two-dimensional manifolds. It provides a solution to the word problem for braids, the question of determining whether two different-looking braid presentations really describe the same group element. It also describes the braid groups as automorphism groups of free groups and of multiply-punctured disks.[5]
The next three chapters present connections of braid groups to three different areas of mathematics. Chapter 2 concerns applications to knot theory, via Alexander's theorem that every knot or link can be formed by closing off a braid, and provides the first complete proof of the Markov theorem on equivalence of links formed in this way. It also includes material on the conjugacy problem,[5] important in this area because conjugate braids close off to form the same link,[1] and on the "algebraic link problem" (not to be confused with algebraic links) in which one must determine whether two links can be related to each other by finitely many moves of a certain type, equivalent to the homeomorphism of link complements.[2] Chapter 3 concerns representation theory, and includes Fox derivatives and Fox's free differential calculus,[1] the Magnus representation of free groups and the Gassner and Burau representations of braid groups.[5] Chapter 4 concerns the mapping class groups of 2-manifolds, Dehn twists and the Lickorish twist theorem, and plats, braids closed off in a different way than in Alexander's theorem.[5]
Chapter 5 is titled "plats and links".[1] It moves from 2-dimensional topology to 3-dimensional topology, and is more speculative, concerning connections between braid groups, 3-manifolds, and the classification of links. It includes also an analog of Alexander's theorem for plats, where the number of strands of the resulting plat turns out to be determined by the bridge number of a given link.[5] The appendix provides a list of 34 open problems.[1][5] By the time Wilbur Whitten wrote his review, in June 1975, a handful of these had already been solved.[2]