Proving Finitely Presented Groups are Large by Computer
From MaRDI portal
Publication:4915380
DOI10.1080/10586458.2011.564540zbMath1266.20044arXiv0812.4264OpenAlexW1997006123MaRDI QIDQ4915380
Publication date: 10 April 2013
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.4264
algorithmsfinitely presented groupsword lengthslarge groupsSnapPeafundamental groups of closed hyperbolic 3-manifoldstwo-generator one-relator presentations
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) General geometric structures on low-dimensional manifolds (57M50) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Uses Software
Cites Work
- Largeness of LERF and 1-relator groups.
- Covering spaces of 3-orbifolds
- Virtual Betti numbers of compact locally symmetric spaces
- Large groups of deficiency 1.
- Train tracks and automorphisms of free groups
- A group with an infinite number of Nielsen inequivalent one-relator presentations
- The virtual Haken conjecture: Experiments and examples
- Mapping tori with first Betti number at least two
- On the virtual Betti numbers of arithmetic hyperbolic 3-manifolds
- Reflections on the residual finiteness of one-relator groups.
- On free products with amalgamation of two infinite cyclic groups
- Determining Subgroups of a Given Finite Index in a Finitely Presented Group
- On a Class of One-Relator Groups
- Free subgroups in groups of small deficiency
- Free Quotients of Finitely Presented Groups
- A non-cyclic one-relator group all of whose finite quotients are cyclic
- A Finitely Generated Infinite Simple Group
