On what finitely generated (left-orderable) simple groups can know about their subgroups
Group Theory
2025-04-18 v1
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.
Cite
@article{arxiv.2504.12707,
title = {On what finitely generated (left-orderable) simple groups can know about their subgroups},
author = {Arman Darbinyan and Markus Steenbock},
journal= {arXiv preprint arXiv:2504.12707},
year = {2025}
}
Comments
10 pages. Final author's version. Original research paper published in S\'eminaires & Congr\`es 34