A STRUCTURAL PROPERTY CONCERNING ABSTRACT COMMENSURABILITY OF SUBGROUPS
abstractly commensurable groupsfinitely generated groupsfinitely generated subgroupsgeneralized word problemGrigorchuk groupssubgroup separabilitysubgroups of finite index
Subgroup theorems; subgroup growth (20E07) Residual properties and generalizations; residually finite groups (20E26) General structure theorems for groups (20E34) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Periodic groups; locally finite groups (20F50)
The paper continues the study on the further properties of the remarkable ``first Grigorchuk group \(\Gamma\) started by \textit{R. I. Grigorchuk} [in Funct. Anal. Appl. 14, 41-43 (1980); translation from Funkts. Anal. Prilozh. 14, No. 1, 53-54 (1980; Zbl 0595.20029), Sov. Math., Dokl. 28, 23-26 (1983); translation from Dokl. Akad. Nauk SSSR 271, 30-33 (1983; Zbl 0547.20025), Math. USSR, Izv. 25, 259-300 (1985); translation from Izv. Akad. Nauk SSSR, Ser. Mat. 48, No. 5, 939-985 (1984; Zbl 0583.20023)]. The first and main result concerns the structure of the finitely generated subgroups in \(\Gamma\). Two groups are called (abstractly) commensurable if they have isomorphic subgroups of finite index. Theorem 1. Every infinite finitely generated subgroup of \(\Gamma\) is (abstractly) commensurable with \(\Gamma\). -- In particular, since the group \(\Gamma\) itself is an infinite finitely generated group, we get that any two infinite finitely generated subgroups of \(\Gamma\) are (abstractly) commensurable with each other. The second property established is connected with subgroup separability in \(\Gamma\), and with the generalized word problem. A group is called subgroup separable if each finitely generated subgroup of it is an intersection of subgroups of finite index. And the generalized word problem for a group \(G\) asks whether there is an algorithm which for the given element \(g\in G\) and for a given finitely generated subgroup \(H\leq G\) determines whether or not \(g\) is in \(H\). It is known [loc. cit. (Zbl 0583.20023)] that if in a group with soluble (ordinary) word problem, subgroup separability is present, then the generalized word problem also is soluble. The (ordinary) word problem for \(\Gamma\) is soluble [loc. cit. (Zbl 0595.20029)]. Theorem 2. The group \(\Gamma\) is subgroup separable and consequently the generalized word problem for \(\Gamma\) is soluble.
- Commutator width in the first Grigorchuk group
- The twisted twin of the Grigorchuk group.
- LOWER BOUNDS ON THE GROWTH OF A GROUP ACTING ON THE BINARY ROOTED TREE
- Not residually finite groups of intermediate growth, commensurability and non-geometricity.
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group
- Abstract commensurability and the Gupta-Sidki group
- The asymptotic dimension of the first Grigorchuk group is infinity.
- On the Novikov and Boone-Borisov groups
- Finitely generated subgroups of branch groups and subdirect products of just infinite groups
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
- Not residually finite groups of intermediate growth, commensurability and non-geometricity.
- Maximal subgroups of groups of intermediate growth
- Cohomological invariants and the classifying space for proper actions.
- Computability of finite quotients of finitely generated groups
- Commutator width in the first Grigorchuk group
- On the Cantor-Bendixson rank of the Grigorchuk group and the Gupta-Sidki 3 group
- On maximal subgroups of infinite index in branch and weakly branch groups
- Weakly maximal subgroups in regular branch groups.
- From isolated subgroups to generic permutation representations
- Finitely generated subgroups of lattices in \(\text{PSL}_2\mathbb C\).
- The subpower membership problem for finite algebras with cube terms
- scientific article; zbMATH DE number 2156384 (Why is no real title available?)
- On the residual and profinite closures of commensurated subgroups
- On commensurability of right-angled Artin groups II: RAAGs defined by paths
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group
- Finitely generated subgroups of branch groups and subdirect products of just infinite groups
- On separability finiteness conditions in semigroups
- Branch groups, orbit growth, and subgroup growth types for pro-p groups
- Maximal subgroups of nontorsion Grigorchuk–Gupta–Sidki groups
- On the profinite rigidity of free and surface groups
- Weakly maximal subgroups of branch groups
- Invariable generation of certain branch groups
- Subgroup induction property for branch groups
- Perfect kernel and dynamics: from Bass-Serre theory to hyperbolic groups
- On maximal subgroups of ample groups
- Finitely presented wreath products and double coset decompositions.
This page was built for publication: A STRUCTURAL PROPERTY CONCERNING ABSTRACT COMMENSURABILITY OF SUBGROUPS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819575)