SearcharxivSearch

arXiv · 2409.19427

Root group data (RGD) systems of affine type for significant subgroups of isotropic reductive groups over $k[t,t^{-1}]$

Abstract

Given a connected isotropic reductive not necessarily split $k$-group $\mathcal{G}$ with irreducible relative root system, we construct root group data (RGD) system of affine type for significant subgroups of $\mathcal{G}(k[t,t^{-1}])$, which can be extended to the whole group $\mathcal{G}(k[t,t^{-1}])$ under certain additional requirements. We rely on the relative pinning maps from paper "Elementary subgroups of isotropic reductive groups" by V. Petrov and A. Stavrova to construct the affine root groups. To verify the RGD axioms, we utilize the properties of the affine root groups, and the properties of reflections associated with the $k$-roots of $\mathcal{G}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuan Zhang. 2024-09-28. Root group data (RGD) systems of affine type for significant subgroups of isotropic reductive groups over $k[t,t^{-1}]$. https://arxiv.org/abs/2409.19427

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