On the difficulty of presenting finitely presentable groups
We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of integer matrices, and right-angled Coxeter groups form such classe...
| Hlavní autoři: | , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
2010
|