• Corpus ID: 119130765

Investigating self-similar groups using their finite $L$-presentation

  title={Investigating self-similar groups using their finite \$L\$-presentation},
  author={Ren{\'e} Hartung},
  journal={arXiv: Group Theory},
  • René Hartung
  • Published 19 April 2012
  • Mathematics
  • arXiv: Group Theory
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive (possibly infinite) presentation, a so-called finite $L$-presentation. Finite $L$-presentations allow numerous algorithms for finitely presented groups to be generalized to this special class of recursive presentations. We give an overview of the algorithms for… 

Tables from this paper

A Note on Invariantly Finitely $L$-Presented Groups
In the first part of this note, we introduce Tietze transformations for $L$-presentations. These transformations enable us to generalize Tietze's theorem for finitely presented groups to invariantly


Coset Enumeration for certain Infinitely Presented Groups
This algorithm shows that the subgroup membership problem for finite index subgroups in a finitely $L$-presented group is decidable.
A Reidemeister-Schreier theorem for finitely $L$-presented groups
We prove a variant of the well-known Reidemeister-Schreier theorem for finitely $L$-presented groups. More precisely, we prove that each finite index subgroup of a finitely $L$-presented group is
Hausdorff dimension in a family of self-similar groups
For every prime p and every monic polynomial f, invertible over p, we define a group Gp, f of p-adic automorphisms of the p-ary rooted tree. The groups are modeled after the first Grigorchuk group,
Determining Subgroups of a Given Finite Index in a Finitely Presented Group
The use of computers to investigate groups has mainly been restricted to finite groups. In this work, a method is given for finding all subgroups of finite index in a given group, which works equally
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications
A nilpotent quotient algorithm is described for a certain class of infinite presentations: the so-called finite L-presentations and conjectural descriptions of the lower central series structure of various interesting groups including the Grigorchuk supergroup, the Brunner–Sidki–Vieira group, the Basilica group, and certain generalizations of the Fabrykowski–Gupta group are obtained.
Applications and adaptations of the low index subgroups procedure
A number of significant applications of the low-index subgroups procedure are discussed, in particular to the construction of graphs and surfaces with large automorphism groups and three useful adaptations of the procedure are described.
Application of Computational Tools for Finitely Presented Groups
Under suitable circumstances a finitely presented group can be shown to be soluble and its complete derived series can be determined, using what is in effect a soluble quotient algorithm.
Topics in Geometric Group Theory
In this book, Pierre de la Harpe provides a concise and engaging introduction to geometric group theory, a new method for studying infinite groups via their intrinsic geometry that has played a major
A practical method for enumerating cosets of a finite abstract group
An important problem in finite-group theory is the determination of an abstract definition for a given group , that is, a set of relations between k generating operations S 1 , …., S k of , such that
On the Burnside problem for periodic groups
Narain Gupta 1,. and Said Sidki 2 1 University of Manitoba, Department of Mathematics, Winnipeg, Manitoba R3T 2N2, Canada 2 University of Brasilia, Department of Mathematics, Brasilia, D.F., Brazil