Cargando…
Embeddings into left‐orderable simple groups
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...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley and Sons Inc.
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9305904/ https://www.ncbi.nlm.nih.gov/pubmed/35910715 http://dx.doi.org/10.1112/jlms.12552 |