The bounded and precise word problems for presentations of groups / / S.V. Ivanov.
"We introduce and study 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 p...
Saved in:
| Superior document: | Memoirs of the American Mathematical Society, number 1281 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Providence, RI : : American Mathematical Society,, 2020. |
| Year of Publication: | 2020 |
| Language: | English |
| Series: | Memoirs of the American Mathematical Society ;
number 1281. |
| Online Access: | |
| Physical Description: | 1 online resource (118 pages). |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Preliminaries
- Proof of proposition 1.1
- Calculus of brackets for group presentation (1.2)
- Proofs of theorem 1.2 and corollary 1.3
- Calculus of brackets for group presentation (1.4)
- Proof of theorem 1.4
- Minimizing diagrams over (1.2) and proofs of theorem 1.5 and corollary 1.6
- Construction of minimal diagrams over (1.4) and proof of theorem 1.7
- Polygonal curves in the plane and proofs of theorems 1.8, 1.9 and corollary 1.10.