Algorithms and Classification in Combinatorial Group Theory

✍ Scribed by Charles F. Miller III (auth.), Gilbert Baumslag, Charles F. Miller III (eds.)

Publisher: Springer-Verlag New York
Year: 1992
Tongue: English
Leaves: 234
Series: Mathematical Sciences Research Institute Publications 23
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

The papers in this volume are the result of a workshop held in January 1989 at the Mathematical Sciences Research Institute. Topics covered include decision problems, finitely presented simple groups, combinatorial geometry and homology, and automatic groups and related topics.

✦ Table of Contents

Front Matter....Pages i-viii
Decision Problems for Groups — Survey and Reflections....Pages 1-59
The Word Problem for Solvable Groups and Lie Algebras....Pages 61-67
Solution of the Conjugacy Problem in One-Relator Groups....Pages 69-81
A Tour Around Finitely Presented Infinite Simple Groups....Pages 83-119
The Geometry of Finitely Presented Infinite Simple Groups....Pages 121-136
The Geometry of Rewriting Systems: A Proof of the Anick-Groves-Squier Theorem....Pages 137-163
Combings of Groups....Pages 165-178
Automatic Groups and Amalgams — A Survey....Pages 179-194
Dehn Functions and l 1 -norms of Finite Presentations....Pages 195-224
Problems on Automatic Groups....Pages 225-232

✦ Subjects

Combinatorics

📜 SIMILAR VOLUMES

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2005 🏛 Springer 🌐 English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte 📂 Library 📅 2012 🏛 Springer 🌐 English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Algorithms and Classification in Combina

📁 Algorithms and Classification in Combinatorial Group Theory (Mathematical Sciences Research Institute Publications, 23)

✍ Gilbert Baumslag (editor), Charles F. III Miller (editor) 📂 Library 📅 2011 🏛 Springer 🌐 English

<span>In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and Stallings. The organisers of the workshop were G

Combinatorial Group Theory (Classics in

📁 Combinatorial Group Theory (Classics in Mathematics)

✍ Roger C. Lyndon, Paul E. Schupp 📂 Library 📅 2001 🌐 English

From the reviews: "This book [...] defines the boundaries of the subject now called combinatorial group theory. [...] it is a considerable achievement to have concentrated a survey of the subject into 339 pages. [...] a valuable and welcome addition to the literature, containing many results not pre

Combinatorial Group Theory (Classics in

📁 Combinatorial Group Theory (Classics in Mathematics)

✍ Roger C. Lyndon, Paul E. Schupp 📂 Library 📅 2001 🌐 English