SearcharxivSearch

arXiv · 0911.0628

An Aschbacher--O'Nan--Scott theorem for countable linear groups

Abstract

The purpose of this note is to extend the classical Aschbacher--O'Nan--Scott theorem for finite groups to the class of countable linear groups. This relies on the analysis of primitive actions carried out in a previous paper. Unlike the situation for finite groups, we show here that the number of primitive actions depends on the type: linear groups of almost simple type admit infinitely (and in fact unaccountably) many primitive actions, while affine and diagonal groups admit only one. The abundance of primitive permutation representations is particularly interesting for rigid groups such as simple and arithmetic ones.

Explore related subjects

Keep this discovery

BibTeXRIS

Tsachik Gelander, Yair Glasner. 2009-11-03. An Aschbacher--O'Nan--Scott theorem for countable linear groups. https://arxiv.org/abs/0911.0628

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