Abstract
0.1. Let G be a connected reductive algebraic group defined over a finite field Fq and let G(Fq) be the finite group of all Fq -rational points of G. We would like to present here a strategy for computing the character table of G(Fq), under the assumption that p, the characteristic of Fq, is sufficiently large. We can assume that G has a simply connected derived group. Indeed, in the general case, we can find a connected reductive group G with simply connected derived group, and a surjective homomorphism f: G -* G whose kernel is a central torus such that G and f are defined over Fq; then the character table
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
