×éºÏȺÂÛ

Chapter ¢ñ£®Free Groups and Their SubgroupsI£®Introduction2£®Nielsen's Method3£®Subgroups of Free Groups4£®Automorphisms of Free Groups5£®Stabilizers in Aut£¨F£©6£®Equations over Groups7£®Quadratic Sets of Word8£®Equations in Free Groups9£®Abstract Length Functions10£®Representations of Free Groups£» the Fox Calculus11£®Free Products with AmalgamationChapler ¢ò£®Generators and RelationsI£®Introduction2£®Finite Presentations3£®Fox Calculus£¬ Relation Matrices£¬ Connections with Cohomology4£®The Reidemeister-Schreier Method5£®Groups with a Single Defining Relator6£®Magnus' Treatment of One-Relator GroupsChapter ¢ó£®Geometric Methods1£®Introduction2£®Complexes3£®Covering Maps4£®Cayley Complexes5£®Planar Caley Complexes6£®F-Groups Continued7£®Fuchsian Complexes8£®Planar Groups with Reflections9£®Singular Subcomplexes10£®Spherical Diagrams11£®Aspherical Groups12£®Coset Diagrams and Permutation Representations13£®Behr GraphsChapter ¢ô£®Free Products and HNN Extensions1£®Free Products2£®Higman-Neumann-Neumann Extensions and Free Products with Amalgamation3£®Some Embedding Theorems4£®Some Decision Problems5£®One-Relator Groups6£®Bipolar Structures7£®The Higman Embcdding Theorem8£®Algebraically Closed GroupsChapter ¢õ£®Small Cancellation Theory1£®Diagrams2£®The Small Cancellation Hypotheses3£®The Basic Formulas4£®Dehn's Algorithm and Greendtinger's Lemma5£®The Conjugacy Problem6£®The Word Problem7£®The Conjugacy Problem8£®Applications to Knot Groups9£®The Theory over Free Products10£®Small Cancellation Products11£®Small Cancellation Theory over Free Products with Amalgamation and HNN ExtensionsBibliographyRussian Names in CyrillicIndex of NamesSubject Index