Abstract
How many generators and relations does $\text{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]])$.
Highlights
There has been a number of papers showing that various infinite families of groups have presentations with bounded number of generators and relations
This result is known if the family A is a family of finite simple groups
[11,12,13], a family of affine Kac–Moody groups defined over finite fields [3], c The Author(s) 2018
Summary
There has been a number of papers showing that various infinite families of groups have presentations with bounded number of generators and relations. Let G be a connected affine Kac–Moody group of rank n > 3 defined over a finite field Fq. If q > 4, G has a presentation with 2 generators and at most 72 relations. Using our techniques we derive quantitative bounds on the presentations of arbitrary affine Kac–Moody groups over finite fields
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.