Softcover ISBN:  9781470441432 
Product Code:  MEMO/264/1281 
List Price:  $85.00 
MAA Member Price:  $76.50 
AMS Member Price:  $51.00 
eBook ISBN:  9781470458041 
Product Code:  MEMO/264/1281.E 
List Price:  $85.00 
MAA Member Price:  $76.50 
AMS Member Price:  $51.00 
Softcover ISBN:  9781470441432 
eBook: ISBN:  9781470458041 
Product Code:  MEMO/264/1281.B 
List Price:  $170.00 $127.50 
MAA Member Price:  $153.00 $114.75 
AMS Member Price:  $102.00 $76.50 
Softcover ISBN:  9781470441432 
Product Code:  MEMO/264/1281 
List Price:  $85.00 
MAA Member Price:  $76.50 
AMS Member Price:  $51.00 
eBook ISBN:  9781470458041 
Product Code:  MEMO/264/1281.E 
List Price:  $85.00 
MAA Member Price:  $76.50 
AMS Member Price:  $51.00 
Softcover ISBN:  9781470441432 
eBook ISBN:  9781470458041 
Product Code:  MEMO/264/1281.B 
List Price:  $170.00 $127.50 
MAA Member Price:  $153.00 $114.75 
AMS Member Price:  $102.00 $76.50 

Book DetailsMemoirs of the American Mathematical SocietyVolume: 264; 2020; 106 ppMSC: Primary 20; 68; Secondary 52
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the BaumslagSolitar onerelator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space.
As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.

Table of Contents

Chapters

1. Introduction

2. Preliminaries

3. Proof of Proposition 1.1

4. Calculus of Brackets for Group Presentation (1.2)

5. Proofs of Theorem 1.2 and Corollary 1.3

6. Calculus of Brackets for Group Presentation (1.4)

7. Proof of Theorem 1.4

8. Minimizing Diagrams over (1.2) and Proofs of Theorem 1.5 and Corollary 1.6

9. Construction of Minimal Diagrams over (1.4) and Proof of Theorem 1.7

10. Polygonal Curves in the Plane and Proofs of Theorems 1.8, 1.9 and Corollary 1.10


Additional Material

RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Requests
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the BaumslagSolitar onerelator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space.
As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.

Chapters

1. Introduction

2. Preliminaries

3. Proof of Proposition 1.1

4. Calculus of Brackets for Group Presentation (1.2)

5. Proofs of Theorem 1.2 and Corollary 1.3

6. Calculus of Brackets for Group Presentation (1.4)

7. Proof of Theorem 1.4

8. Minimizing Diagrams over (1.2) and Proofs of Theorem 1.5 and Corollary 1.6

9. Construction of Minimal Diagrams over (1.4) and Proof of Theorem 1.7

10. Polygonal Curves in the Plane and Proofs of Theorems 1.8, 1.9 and Corollary 1.10