SearcharxivSearch

arXiv · 2305.02953

Steep uncountable groups

Abstract

We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural number $n_Y$ for which every element of $G$ may be expressed as a product of length at most $n_Y$ of elements in $Y^{\pm 1}$. In particular this group is J\'onsson (every proper subgroup is of strictly smaller cardinality) and strongly bounded (every abstract action on a metric space has bounded orbits); this is the first example of an uncountable group having both of these properties which is constructed without using the continuum hypothesis. The group $G$ can also be made so that all subgroups are simple and all nontrivial subgroups are malnormal in $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Samuel M. Corson, Alexander Olshanskii, Olga Varghese. 2023-05-04. Steep uncountable groups. https://doi.org/10.1112/blms.12959

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