Testing matrix groups for primitivity
From MaRDI portal
Publication:1815003
DOI10.1006/JABR.1996.0285zbMATH Open0865.20013OpenAlexW2049435176MaRDI QIDQ1815003FDOQ1815003
Derek F. Holt, Sarah Rees, E. A. O'Brien, C. R. Leedham-Green
Publication date: 15 July 1997
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jabr.1996.0285
Recommendations
algorithmsactionsirreducible matrix groupsmatrix groups defined over finite fieldssystems of blocks of imprimitivity
Cited In (15)
- Constructive Sylow theorems for the classical groups.
- A computer-assisted analysis of some matrix groups.
- Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field
- Computing in Nilpotent Matrix Groups
- A practical model for computation with matrix groups.
- Generating random elements of a finite group
- Conjugacy of Subgroups of the General Linear Group
- Tensor products are projective geometries
- DETERMINING ASCHBACHER CLASSES USING CHARACTERS
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
- Algorithms for matrix groups and the Tits alternative
- Constructive recognition of classical groups in their natural representation.
- Recognising tensor-induced matrix groups.
- Prime power graphs for groups of Lie type
Uses Software
This page was built for publication: Testing matrix groups for primitivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815003)