Embeddings into left‐orderable simple groups

DOI10.1112/JLMS.12552MaRDI QIDQ6134473zbMATH OpenOpenAlexFDO

Authors

Publication date 22 August 2023

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2005.06183

zbMATH Keywords

simple groupword problemcombinatorial group theoryThompson's theoremBoone-Higman's theoremleft-ordered group

Mathematics Subject Classification ID

Ordered groups (06F15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (group-theoretic aspects) (20F60) Simple groups (20E32)

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.

Recommendations

• Countable lattice-ordered groups
• Embeddings in lattice-\(O^*\)-groups
• Embedding groups in locally (soluble-by-finite) simple groups
• An Embedding Construction for Ordered Groups
• Embeddings into Simple Free Products

Cites work

• scientific article; zbMATH DE number 3670685 (Why is no real title available?)
• scientific article; zbMATH DE number 3741468 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 1221765 (Why is no real title available?)
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• An algebraic characterization of groups with soluble word problem
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• CONSTRUCTIVE ALGEBRAS I
• Chain groups of homeomorphisms of the interval
• Computable Algebra, General Theory and Theory of Computable Fields
• Effective procedures in field theory
• Embedding Theorems for Ordered Groups
• Embeddings into Simple Groups
• Finitely generated infinite simple groups of homeomorphisms of the real line
• Group Embeddings with Algorithmic Properties
• Groups of piecewise linear homeomorphisms of flows
• Imbedding of countable groups in 2-generated simple groups
• Introductory notes on Richard Thompson's groups
• Left-orderable computable groups
• On the embedding of a group in a join of given groups
• Ordered groups and topology
• Recursion theory and ordered groups
• Right orderable groups that are not locally indicable
• The conjugacy problem and Higman embeddings
• Twisted Brin-Thompson groups
• Uniformly perfect finitely generated simple left orderable groups
• Word problems, embeddings, and free products of right-ordered groups with amalgamated subgroup

Cited in

(2)

• SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
• Five embeddings of one simple group

This page was built for publication: Embeddings into left‐orderable simple groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134473)