The bounded and precise word problems for presentations of groups /
"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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Recurso Electrónico livro electrónico |
| Idioma: | inglês |
| Publicado em: |
Providence, RI :
American Mathematical Society,
2020.
|
| Colecção: | Memoirs of the American Mathematical Society ;
number 1281. |
| Assuntos: |
Group theory and generalizations
> Special aspects of infinite or finite groups
> Geometric group theory [See also 05C25, 20E08, 57Mxx].
Group theory and generalizations
> Special aspects of infinite or finite groups
> Generators, relations, and presentations.
Group theory and generalizations
> Special aspects of infinite or finite groups
> Cancellation theory; application of van Kampen diagrams [See also 57M05].
|
| Acesso em linha: | Click to View |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Sumário:
- 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.