2000 character limit reached
Universality of group embeddability
Published 13 Feb 2017 in math.LO | (1702.03787v3)
Abstract: Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the isometric embeddability between separable groups with a bounded bi-invariant complete metric are all invariantly universal analytic quasi-orders. This strengthens some results from [Wil14] and [FLR09].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.