Embeddings into left-orderable simple groups
- PMID: 35910715
- PMCID: PMC9305904
- DOI: 10.1112/jlms.12552
Embeddings into left-orderable simple groups
Abstract
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a Boone-Higman-Thompson type theorem for left-orderable groups with recursively enumerable positive cones. These embeddings are Frattini embeddings, and isometric whenever the initial group is finitely generated. Finally, we reprove Thompson's theorem on word problem preserving embeddings into finitely generated simple groups and observe that the embedding is isometric.
© 2022 The Authors. Journal of the London Mathematical Society is copyright © London Mathematical Society.
References
-
- Bergman G. M., Right orderable groups that are not locally indicable, Pac. J. Math. 147 (1991), no. 2, 243–248.
-
- Bludov V. V. and Glass A. M. W., Word problems, embeddings, and free products of right‐ordered groups with amalgamated subgroup, Proc. Lond. Math. Soc. (3) 99 (2009), no. 3, 585–608.
-
- Boone W. W. and Higman G., An algebraic characterization of groups with soluble word problem, J. Austral. Math. Soc. 18 (1974), 41–53. (Collection of articles dedicated to the memory of Hanna Neumann, IX.)
-
- Bridson M. R., Controlled embeddings into groups that have no non‐trivial finite quotients, In The Epstein birthday schrift, Geom. Topol. Monogr., vol. 1, Geom. Topol. Publ., Coventry, 1998, pp. 99–116.
-
- Belk J. and Zaremsky M. C. B., Twisted Brin‐Thompson groups. arXiv:2001.04579, 2020.
LinkOut - more resources
Full Text Sources