A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS

DOI10.1142/S0218196708004871zbMath1173.20023arXiv0706.3131OpenAlexW3101384482MaRDI QIDQ3601327

Bettina Eick, René Hartung, Laurent Bartholdi

Publication date: 10 February 2009

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

nilpotent groupslower central seriesself-similar groupsfinite \(L\)-presentationsinfinite presentationsnilpotent quotientsnilpotent quotient algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (5)

Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. ⋮ On the Basilica operation ⋮ THE TWISTED TWIN OF THE GRIGORCHUK GROUP ⋮ On the stable Andreadakis problem ⋮ COSET ENUMERATION FOR CERTAIN INFINITELY PRESENTED GROUPS

Uses Software

• GAP
• NQL
• NQ
• FR

Cites Work

• Amenability via random walks.
• Lie algebras and growth in branch groups.
• On the Burnside problem for periodic groups
• On a 2-generated infinite 3-group: The presentation problem
• A just-nonsolvable torsion-free group defined on the binary tree
• Linear pro-\(p\)-groups of finite width
• Endomorphic presentations of branch groups.
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• A finitely generated, infinitely related group with trivial multiplicator

This page was built for publication: A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS