Search arXivSearch

arXiv · 2107.01258

Overgroups of subsystem subgroups in exceptional groups: nonideal levels

Abstract

In the present paper, we practicaly complete the solution of the problem on the description of overgroups of the subsystem subgroup $E(\Delta,R)$ in the Chevalley group $G(\Phi,R)$ over the ring $R$, where $\Phi$ is a simply laced root system, and $\Delta$ is its large enough subsystem. Namely we define objects called levels, and show that for any such an overgroup $H$ there exists a unique level $\sigma$ such that $E(\sigma)\le H\le \mathrm{Stab}_{G(\Phi,R)}(L_{\max}(\sigma))$, where $E(\sigma)$ is an elementary subgroup defined by the level $\sigma$, and $L_{\max}(\sigma)$ is the corresponding Lie subalgebra in the Chevalley algebra. Unlike all the previous papers, now levels can be more complicated objects that the nets of ideals.

Explore related subjects

Keep this discovery

BibTeXRIS

Pavel Gvozdevsky. 2021-07-02. Overgroups of subsystem subgroups in exceptional groups: nonideal levels. https://doi.org/10.1090/spmj/1733

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