Proving finitely presented groups are large by computer.
From MaRDI portal
Abstract: We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it to a range of presentations. Our main focus is on 2-generator 1-relator presentations where we have a complete picture of largeness if the relator has exponent sum zero in one generator and word length at most 12, as well as when the relator is in the commutator subgroup and has word length at most 18. Indeed all but a tiny number of presentations define large groups. Finally we look at fundamental groups of closed hyperbolic 3-manifolds, where the algorithm readily determines that a quarter of the groups in the Snappea closed census are large.
Recommendations
Cites work
- A Finitely Generated Infinite Simple Group
- A group with an infinite number of Nielsen inequivalent one-relator presentations
- A non-cyclic one-relator group all of whose finite quotients are cyclic
- Covering spaces of 3-orbifolds
- Determining Subgroups of a Given Finite Index in a Finitely Presented Group
- Free Quotients of Finitely Presented Groups
- Free subgroups in groups of small deficiency
- Large groups of deficiency 1.
- Largeness of LERF and 1-relator groups.
- Mapping tori with first Betti number at least two
- On a Class of One-Relator Groups
- On free products with amalgamation of two infinite cyclic groups
- On the virtual Betti numbers of arithmetic hyperbolic 3-manifolds
- Reflections on the residual finiteness of one-relator groups.
- The virtual Haken conjecture: Experiments and examples
- Train tracks and automorphisms of free groups
- Virtual Betti numbers of compact locally symmetric spaces
Cited in
(3)
This page was built for publication: Proving finitely presented groups are large by computer.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915380)
