Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field

DOI10.1112/S1461157000000589zbMath1225.20040MaRDI QIDQ3091964

Derek F. Holt, Mark Stather

Publication date: 15 September 2011

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmschief seriessoluble radicalmatrix groups over finite fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Other matrix groups over finite fields (20H30)

Related Items (2)

Computing conjugacy classes of elements in matrix groups. ⋮ A practical model for computation with matrix groups.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal subgroups of the finite classical groups
• Computing chief series, composition series and socles in large permutation groups
• Automorphism group computation and isomorphism testing in finite groups
• Testing matrix groups for primitivity
• Computing matrix group decompositions with respect to a normal subgroup
• Recognising tensor-induced matrix groups.
• The probability of generating a finite simple group
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Recognising the Suzuki groups in their natural representations.
• Computing conjugacy class representatives in permutation groups.
• Writing projective representations over subfields.
• Computing maximal subgroups of finite groups.
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Recognising Tensor Products of Matrix Groups
• Generating random elements of a finite group
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)

This page was built for publication: Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field