On what finitely generated (left-orderable) simple groups can know about their subgroups
This paper surveys recent results on embeddings of countable groups into finitely generated left-orderable simple groups, with emphasis on how the ambient group can retain algorithmic, geometric and algebraic information about the embedded subgroup.\N\NA central result states that every countable left-orderable group admits a Frattini embedding (an embedding preserving the conjugacy structure) into a finitely generated left-orderable simple group; if the group is finitely generated, the embedding can be chosen isometric. Further results relate the existence of a computable left-order or of a decidable membership problem, to the existence of suitable embeddings into finitely generated simple groups with the corresponding properties.\N\NThese results are extended to recursively enumerable families of finitely generated left-orderable groups, yielding finitely generated simple groups that simultaneously contain quasi-isometric and Frattini copies of each member. As a consequence, a finitely generated group has decidable word problem if and only if it quasi-isometrically embeds into a finitely generated simple subgroup of a finitely presented group.\N\NFor the entire collection see [Zbl 1562.20002].
This page was built for publication: On what finitely generated (left-orderable) simple groups can know about their subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856541)
