The twisted twin of the Grigorchuk group.

DOI10.1142/S0218196710005728zbMATH Open1273.20022arXiv0904.1600OpenAlexW3100401588MaRDI QIDQ3580221FDOQ3580221

Authors: Laurent Bartholdi, Olivier Siegenthaler 

Publication date: 11 August 2010

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

Abstract: We study a twisted version of Grigorchuk's first group, and stress its similarities and differences to its model. In particular, we show that it admits a finite endomorphic presentation, has infinite-rank multiplier, and does not have the congruence property.

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

Recommendations

• On the closure of the first Grigorchuk group.
• ON THE WORD AND PERIOD GROWTH OF SOME GROUPS OF TREE AUTOMORPHISMS
• scientific article; zbMATH DE number 1487721
• Lower central series of a group of tree automorphisms
• LOWER BOUNDS ON THE GROWTH OF A GROUP ACTING ON THE BINARY ROOTED TREE

zbMATH Keywords

Schur multiplierstorsion groupsgroups acting on treesautomata groupsself-similar groupsjust-infinite groupscongruence propertyendomorphic presentations

Mathematics Subject Classification ID

Groups acting on trees (20E08) Limits, profinite groups (20E18) Generators, relations, and presentations of groups (20F05) Derived series, central series, and generalizations for groups (20F14) Periodic groups; locally finite groups (20F50)

Cites Work

• On a 2-generated infinite 3-group: The presentation problem
• Endomorphic presentations of branch groups.
• A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS

Cited In (18)

• Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups.
• On the closure of the first Grigorchuk group.
• The congruence subgroup problem for branch groups.
• A constructive proof that the Hanoi towers group has non-trivial rigid kernel
• A system of defining relations for a Grigorchuk group
• Block-counting sequences are not purely morphic
• How to prove that a sequence is not automatic
• Commensurability growth of branch groups
• Factorizations of self-similar groups associated to the first Grigorchuk group
• Profinite completion of Grigorchuk's group is not finitely presented.
• How programming was used to determine factorizations of self-similar groups associated to the first Grigorchuk group
• Tree languages and branched groups
• A branch group in a class of non-contracting weakly regular branch groups
• Hidden automatic sequences
• \(p\)-Basilica groups
• The congruence subgroup problem for a family of branch groups
• Twistors and the BMS group
• A STRUCTURAL PROPERTY CONCERNING ABSTRACT COMMENSURABILITY OF SUBGROUPS

Uses Software

• GAP
• kbmag
• NQL

This page was built for publication: The twisted twin of the Grigorchuk group.

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