SearcharxivSearch

arXiv · 1609.02464

Presentations of affine Kac-Moody groups

Abstract

How many generators and relations does ${\mathrm SL}_n({\mathbb F}_q[t, t^{-1}])$ need? In this paper we exhibit its explicit presentation with $9$ generators and $44$ relations. We investigate presentations of affine Kac-Moody groups over finite fields. Our goal is to derive finite presentations, independent of the field and with as few generators and relations as we can achieve. It turns out that any simply connected affine Kac-Moody group over a finite field has a presentation with at most 11 generators and 70 relations. We describe these presentations explicitly type by type. As a consequence, we derive explicit presentations of Chevalley groups $G({\mathbb F}_q[t, t^{-1}])$ and explicit profinite presentations of profinite Chevalley groups $G({\mathbb F}_q[[t]])$.

Explore related subjects

Keep this discovery

BibTeXRIS

Inna Capdeboscq, Karina Kirkina, Dmitriy Rumynin. 2016-09-08. Presentations of affine Kac-Moody groups. https://arxiv.org/abs/1609.02464

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