Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients

DOI10.1112/S1461157009000229MaRDI QIDQ3092001zbMATH OpenFDO

Authors René Hartung

Publication date 15 September 2011

Published in LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.1098

zbMATH Keywords

algorithmsfinitely generated groupsSchur multipliersfinitely presented groupsself-similar groupsfinitely \(L\)-presented groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Derived series, central series, and generalizations for groups (20F14) Software, source code, etc. for problems pertaining to group theory (20-04) Projective representations and multipliers (20C25)

Abstract: We describe an algorithm for computing successive quotients of the Schur multiplier $M(G)$ for a group $G$ given by an invariant finite $L$-presentation. As application, we investigate the Schur multipliers of various self-similar groups such as the Grigorchuk super-group, the generalized Fabrykowski-Gupta groups, the Basilica group and the Brunner-Sidki-Vieira group.

Recommendations

• Algorithms for finitely L-presented groups and their applications to some self-similar groups.
• A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS
• scientific article; zbMATH DE number 848088
• Computing with Abelian sections of finitely presented groups
• scientific article; zbMATH DE number 3558069
• scientific article; zbMATH DE number 742884
• scientific article; zbMATH DE number 784872
• Algorithms determining finite simple images of finitely presented groups
• scientific article; zbMATH DE number 15580
• Towards a soluble quotient algorithm

Cites work

• scientific article; zbMATH DE number 436375 (Why is no real title available?)
• On Burnside's problem on periodic groups

Cited in

(3)

• Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups.
• Coset enumeration for certain infinitely presented groups.
• A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS

Describes a project that uses

Uses Software

• GAP
• NQL

This page was built for publication: Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients

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