Generating Finite Completely Reducible Linear Groups

DOI10.2307/2048727MaRDI QIDQ5203232zbMATH OpenOpenAlexFDO

Authors 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

finite completely reducible linear groupgenerators

Mathematics Subject Classification ID

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

Recommendations

• On the number of generators and composition length of finite linear groups
• GENERATING FINITE NILPOTENT IRREDUCIBLE LINEAR GROUPS
• scientific article; zbMATH DE number 3957439
• Linear Groups Generated by Elements of Small Degree
• The probability of generating a finite linear group.

Cited in

(15)

• Generating all linear orthomorphisms without repetition
• Linear groups of small degree over fields of finite characteristic
• Asymptotic results for primitive permutation groups
• Invariable generation of permutation and linear groups
• How many elements are needed to generate a finite group with good probability?
• Asymptotic results for primitive permutation groups and irreducible linear 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
• GENERATING FINITE NILPOTENT IRREDUCIBLE 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
• On the minimal dimension of a faithful linear representation of a finite group

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203232)