Testing matrix groups for primitivity

DOI10.1006/JABR.1996.0285MaRDI QIDQ1815003zbMATH OpenOpenAlexFDO

Authors E. A. O'Brien, Sarah Rees, Derek F. Holt, 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

zbMATH Keywords

actionsalgorithmsirreducible matrix groupsmatrix groups defined over finite fieldssystems of blocks of imprimitivity

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40)

Review text

The authors describe an algorithm which seeks to decide whether or not a given irreducible matrix group of finite dimension defined over a finite field preserves a nontrivial system of blocks of imprimitivity in its action on the underlying vector space. In most cases the algorithm will either find at least one block system, or it will prove that the group acts primitively. In some instances however, it may find that the group is semilinear over an extension field before resolving the (im)primitivity problem, in which case it does not conclusively settle the question of (im)primitivity. The algorithm presented is a contribution to the `recognition project' for matrix groups defined over finite fields. The authors aimed to design a `practical' algorithm capable of dealing with matrix groups of dimension up to about 100 over fields of moderate size. Implementations of the algorithm are publicly available in the computer algebra systems GAP and MAGMA.

Recommendations

• Primitivity testing of finite nilpotent linear groups.
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Computing matrix group decompositions with respect to a normal subgroup

Cited in

(16)

• Algorithms for matrix groups and the Tits alternative
• Prime power graphs for groups of Lie type
• Tensor products are projective geometries
• Constructive recognition of classical groups in their natural representation.
• Recognising tensor-induced matrix groups.
• Constructive Sylow theorems for the classical groups.
• A computer-assisted analysis of some matrix groups.
• Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
• Computing a chief series and the soluble radical of a matrix group over a finite field.
• Primitivity testing of finite nilpotent linear groups.
• Computing in Nilpotent Matrix Groups
• A practical model for computation with matrix groups.
• Conjugacy of Subgroups of the General Linear Group
• Generating random elements of a finite group
• Determining Aschbacher classes using characters.
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.

Describes a project that uses

Uses Software

• GAP
• Smash
• Magma

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)