Coset enumeration for certain infinitely presented groups.

DOI10.1142/S0218196711006637MaRDI QIDQ3110892zbMATH OpenFDO

Authors René Hartung

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

zbMATH Keywords

algorithmscoset enumerationfinite \(L\)-presentationsfinitely generated subgroupsGrigorchuk groupsinfinite presentationslow-index subgroupsrecursive presentationsself-similar groupssubgroup membership problemsubgroups of finite index

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Subgroup theorems; subgroup growth (20E07) Maximal subgroups (20E28) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Symbolic computation and algebraic computation (68W30)

Abstract: We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in a finitely $L$-presented group is decidable. As an application, we consider the low-index subgroups of some self-similar groups including the Grigorchuk group, the twisted twin of the Grigorchuk group, the Grigorchuk super-group and the Hanoi 3-group

Recommendations

• Computation with finitely L-presented groups.
• Algorithms for finitely L-presented groups and their applications to some self-similar groups.
• Computing with subgroups of the modular group.
• A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS
• Applications and adaptations of the low index subgroups procedure

Cites work

• A finitely generated, infinitely related group with trivial multiplicator
• A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS
• A practical method for enumerating cosets of a finite abstract group
• Amenability via random walks.
• Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Determining Subgroups of a Given Finite Index in a Finitely Presented Group
• Endomorphic presentations of branch groups.
• scientific article; zbMATH DE number 1544074 (Why is no real title available?)
• Lie algebras and growth in branch groups.
• Non-amenable finitely presented torsion-by-cyclic groups.
• On the failure of the co-Hopf property for subgroups of word-hyperbolic groups
• Proving a group trivial made easy: A case study in coset enumeration
• Solvability of groups of odd order

Cited in

(10)

• Computability of finite quotients of finitely generated groups
• Coset enumeration of groups generated by symmetric sets of involutions.
• A Reidemeister-Schreier theorem for finitely L-presented groups.
• Algorithms for finitely L-presented groups and their applications to some self-similar groups.
• Applications and adaptations of the low index subgroups procedure
• Computation with finitely L-presented groups.
• On \(n\)-Engel pair satisfying certain conditions.
• On generalized conjugacy and some related problems
• Quantifying orbit detection: \(\varphi\)-order and \(\varphi\)-spectrum
• Remarks and problems about algorithmic descriptions of groups

Describes a project that uses

Uses Software

• NQL

This page was built for publication: Coset enumeration for certain infinitely presented groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110892)