Generating Finite Completely Reducible Linear Groups

DOI10.2307/2048727zbMath0725.20031OpenAlexW4242710632MaRDI QIDQ5203232

L. G. Kovács, Geoffrey R. Robinson

Publication date: 1991

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2048727

zbMATH Keywords

generatorsfinite completely reducible linear group

Mathematics Subject Classification ID

Linear algebraic groups over arbitrary fields (20G15) Generators, relations, and presentations of groups (20F05) Other matrix groups over fields (20H20)

Related Items

Asymptotic results for primitive permutation groups ⋮ Algorithms for linear groups of finite rank. ⋮ Minimal and random generation of permutation and matrix groups. ⋮ THE WORK OF L. G. KOVÁCS ON REPRESENTATION THEORY ⋮ L. G. KOVÁCS AND LINEAR GROUPS ⋮ Asymptotic results for primitive permutation groups and irreducible linear groups. ⋮ Invariable generation of permutation and linear groups ⋮ A practical model for computation with matrix groups. ⋮ On the rank of compact \(p\)-adic Lie groups. ⋮ On the number of generators and composition length of finite linear groups ⋮ How many elements are needed to generate a finite group with good probability?

This page was built for publication: Generating Finite Completely Reducible Linear Groups