This seminal, much-cited account begins with a fairly elementary exposition of basic concepts and a discussion of factor groups and subgroups. The topics of Nielsen transformations, free and amalgamated products, and commutator calculus receive detailed treatment. The concluding chapter surveys word, conjugacy, and related problems; adjunction and embedding problems; and more. Second, revised 1976 edition. Unabridged republication of the second, revised (1976) edition, originally published by Interscience Publishers, New York.
Here's a sample of other books in this Dover category
Introduction to Combinatorial Analysis by John Riordan Introductory text surveys the theory of permutations and combinations associated with elementary algebra; the principle of inclusion and exclusion; and the theory of distributions and partitions in cyclic representation. Includes problems. 1958 edition.
Combinatorics for Computer Science by S. Gill Williamson Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with each part divided into a "basic concepts" chapter, followed by 4 "topics" chapters that explore ideas in depth. Includes 219 figures.
Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
Rotations, Quaternions, and Double Groups by Simon L. Altmann This self-contained text presents a consistent description of the geometric and quaternionic treatment of rotation operators, employing methods that lead to a rigorous formulation and offering complete solutions to many illustrative problems.
