Embeddings into left‐orderable simple groups

DOI10.1112/JLMS.12552zbMATH Open1521.20082arXiv2005.06183OpenAlexW4213159453MaRDI QIDQ6134473FDOQ6134473

Author name not available (Why is that?)

Publication date: 22 August 2023

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

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.

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)

Cites Work

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

Cited In (2)

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

   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 👍 👎

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)