On what finitely generated (left-orderable) simple groups can know about their subgroups
On what finitely generated (left-orderable) simple groups can know about their subgroups
In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss some new consequences and also extend some of those embedding theorems to countable classes of finitely generated groups.
59-68
Société Mathématique de France
Darbinyan, Arman
b0ceeed9-a1e1-4bf3-a8d8-efafebebcc27
2025
Darbinyan, Arman
b0ceeed9-a1e1-4bf3-a8d8-efafebebcc27
Darbinyan, Arman
(2025)
On what finitely generated (left-orderable) simple groups can know about their subgroups.
Skipper, Rachel and Chatterji, Indira
(eds.)
In Geometric Methods in Group Theory: Papers Dedicated to Ruth Charney.
vol. 34,
Société Mathématique de France.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss some new consequences and also extend some of those embedding theorems to countable classes of finitely generated groups.
This record has no associated files available for download.
More information
Published date: 2025
Identifiers
Local EPrints ID: 503018
URI: http://eprints.soton.ac.uk/id/eprint/503018
ISSN: 1285-2783
PURE UUID: eee637fd-248d-4824-acbe-b16fba570641
Catalogue record
Date deposited: 16 Jul 2025 16:30
Last modified: 16 Jul 2025 16:30
Export record
Contributors
Author:
Arman Darbinyan
Editor:
Rachel Skipper
Editor:
Indira Chatterji
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics