Combinatorial Group Theory

Combinatorial Group Theory

EnglishPaperback / softback
Kapovich, Ilya
De Gruyter
EAN: 9783119146791
On order
Delivery on Friday, 7. of August 2026
€67.28
Common price €74.75
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

This is an annotated collection of over 200 open problems in combinatorial group theory. One can say that most of the problems are closer in spirit to the "purely combinatorial" group theory. However, the authors included several problems with geometric flavor where they felt this was natural. 
Approximately 20 years ago, a new direction in group theory began to emerge at the interface with theoretical computer science. In recognition of this, the given collection includes problems that are not only significant in combinatorial group theory but also have direct relevance to this emerging area, such as the Post correspondence problem for groups, which is gaining momentum in contemporary research. 
The “flagship” section includes problems about free groups; these have been at the center of combinatorial group theory for over a century, and they are getting ever more popular due to newly discovered connections with the theoretical computer science mentioned above.
Other classes of groups that the authors cover include hyperbolic groups, solvable groups, groups of matrices, and others. The target audience of the book is very broad: from PhD students to senior researchers.

EAN 9783119146791
ISBN 311914679X
Binding Paperback / softback
Publisher De Gruyter
Publication date March 16, 2026
Pages 88
Language English
Dimensions 240 x 170
Country Germany
Authors Kapovich, Ilya; Myasnikov Alexei; Shpilrain Vladimir
Series De Gruyter Textbook
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.