SearcharxivSearch

arXiv · 2010.03394

Metric ultraproducts of groups -- simplicity, perfectness and torsion

Abstract

We characterise the simplicity of metric ultraproducts of a family of metric groups. We also present several new examples of simple groups, such as metric ultraproducts of finite and infinite symmetric groups, linear groups, and interval exchange transformation groups. Using similar methods, we also examine concepts such as genericity, perfectness, and torsion.

Explore related subjects

Keep this discovery

BibTeXRIS

Jakub Gismatullin, Krzysztof Majcher, Martin Ziegler. 2020-10-07. Metric ultraproducts of groups -- simplicity, perfectness and torsion. https://doi.org/10.1016/j.jalgebra.2024.09.005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR