Primitive prime divisor elements in finite classical groups

MaRDI QIDQ4240295zbMATH OpenFDO

Authors Cheryl E. Praeger

Publication date 5 December 1999

Full work available at URL https://arxiv.org/abs/1412.0814

zbMATH Keywords

finite classical groupsgroup algorithmsmatrix groupsprimitive prime divisor elements

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Subgroup theorems; subgroup growth (20E07) Linear algebraic groups over finite fields (20G40)

Abstract: This is an essay about a certain family of elements in the general linear group GL(d,q) called primitive prime divisor elements, or ppd-elements. A classification of the subgroups of GL(d,q) which contain such elements is discussed, and the proportions of ppd-elements in GL(d,q) and the various classical groups are given. This study of ppd-elements was motivated by their importance for the design and analysis of algorithms for computing with matrix groups over finite fields. An algorithm for recognising classical matrix groups, in which ppd-elements play a central role is described.

Recommendations

• Linear Groups with Orders Having Certain Large Prime Divisors
• A Recognition Algorithm For Classical Groups Over Finite Fields
• scientific article; zbMATH DE number 1370596
• Algorithms to identify abundant p-singular elements in finite classical groups.

Cited in

(3)

• Cubic graphical regular representations of some classical simple groups
• OD-characterization of some projective special linear groups over the binary field and their automorphism groups.
• Finite groups satisfying the independence property

This page was built for publication: Primitive prime divisor elements in finite classical groups

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