๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Combinatorial Group Theory (Classics in Mathematics)

โœ Scribed by Roger C. Lyndon, Paul E. Schupp


Year
2001
Tongue
English
Leaves
351
Edition
Reprint
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 previously available in a book. It will undoubtedly become a standard reference." Mathematical Reviews


๐Ÿ“œ SIMILAR VOLUMES


Combinatorial Group Theory (Classics in
โœ 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 Theory (Classics in Mathem
โœ Martin Aigner ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› Springer ๐ŸŒ German

Along with statistics, combinatorics is one of the most maligned fields of mathematics. Often it is not even considered a field in its own right but merely a grab-bag of disparate tricks to be exploited by other, nobler endeavours. Where is the glory in simply counting things? This book goes a long

Algorithms and Classification in Combina
โœ Charles F. Miller III (auth.), Gilbert Baumslag, Charles F. Miller III (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag New York ๐ŸŒ English

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.

Algorithms and Classification in Combina
โœ 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

Classical Topology and Combinatorial Gro
โœ John Stillwell ๐Ÿ“‚ Library ๐Ÿ“… 1993 ๐Ÿ› Springer ๐ŸŒ English

This is a wonderfully intellectual, semi-historical approach to classical topology. Chapter 0 gets some fundamentals out of the way. Chapter 1 is very intriguing and contains lots of ideas. First we are given a taste of the Riemann surfaces of complex analysis. These are complemented by the nonorie