Published 2011
| public
Journal Article
On the difficulty of presenting finitely presentable groups
- Creators
- Bridson, Martin R.
- Wilton, Henry
Abstract
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 classes. We discuss related classes of groups in which there does exist an algorithm to compute finite presentations for finitely presentable subgroups. We also construct a finitely presented group that has a polynomial Dehn function but in which there is no algorithm to compute the first Betti number of its finitely presentable subgroups.
Additional Information
© 2010 European Mathematical Society. Received March 25, 2010; revised July 30, 2010. Bridson is supported by a Senior Fellowship from the EPSRC. Wilton is supported in part by NSF grant DMS-0906276.Additional details
- Eprint ID
- 23278
- Resolver ID
- CaltechAUTHORS:20110412-104051639
- Engineering and Physical Sciences Research Council (EPSRC) Senior Fellowship
- DMS-0906276
- NSF
- Created
-
2011-06-23Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field