SearcharxivSearch

arXiv · 1811.06327

The length and depth of real algebraic groups

Abstract

Let $G$ be a connected real algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G=G_0>G_1>...>G_t=1$ where each $G_i$ is a maximal connected real subgroup of $G_{i-1}$. The maximal (respectively, minimal) length of such an unrefinable chain is called the length (respectively, depth) of $G$. We give a precise formula for the length of $G$, which generalises results of Burness, Liebeck and Shalev on complex algebraic groups and also on compact Lie groups. If $G$ is simple then we bound the depth of $G$ above and below, and in many cases we compute the exact value. In particular, the depth of any simple $G$ is at most $9$.

Explore related subjects

Keep this discovery

BibTeXRIS

Damian Sercombe. 2018-11-15. The length and depth of real algebraic groups. https://arxiv.org/abs/1811.06327

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