COSET ENUMERATION FOR CERTAIN INFINITELY PRESENTED GROUPS
DOI10.1142/S0218196711006637zbMath1235.20031arXiv1106.0259MaRDI QIDQ3110892
Publication date: 16 January 2012
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.0259
algorithms; subgroups of finite index; finitely generated subgroups; Grigorchuk groups; self-similar groups; finite \(L\)-presentations; infinite presentations; recursive presentations; subgroup membership problem; coset enumeration; low-index subgroups
68W30: Symbolic computation and algebraic computation
20E07: Subgroup theorems; subgroup growth
20E28: Maximal subgroups
20F05: Generators, relations, and presentations of groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20-04: Software, source code, etc. for problems pertaining to group theory
Related Items
Uses Software
Cites Work
- Unnamed Item
- Amenability via random walks.
- Lie algebras and growth in branch groups.
- Non-amenable finitely presented torsion-by-cyclic groups.
- Endomorphic presentations of branch groups.
- Solvability of groups of odd order
- Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
- Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients
- Determining Subgroups of a Given Finite Index in a Finitely Presented Group
- A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS
- Proving a group trivial made easy: A case study in coset enumeration
- A finitely generated, infinitely related group with trivial multiplicator
- A practical method for enumerating cosets of a finite abstract group
- On the failure of the co-Hopf property for subgroups of word-hyperbolic groups