Cover -- Title page -- Chapter 1. Introduction -- Chapter 2. Preliminaries -- Chapter 3. Proof of Proposition 1.1 -- Chapter 4. Calculus of Brackets for Group Presentation (1.2) -- Chapter 5. Proofs of Theorem 1.2 and Corollary 1.3 -- Chapter 6. Calculus of Brackets for Group Presentation (1.4) -- Chapter 7. Proof of Theorem 1.4 -- Chapter 8. Minimizing Diagrams over (1.2) and Proofs of Theorem 1.5 and Corollary 1.6 -- Chapter 9. Construction of Minimal Diagrams over (1.4) and Proof of Theorem 1.7 -- Chapter 10. Polygonal Curves in the Plane and Proofs of Theorems 1.8, 1.9 and Corollary 1.10
Summary
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 Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and th
Notes
"March 2020, volume 264, number 1281 (fourth of 6 numbers)."
