scholarly journals Constructing Maximal Subgroups of Classical Groups

2005 ◽  
Vol 8 ◽  
pp. 46-79 ◽  
Author(s):  
Derek F. Holt ◽  
Colva M. Roney-Dougal

AbstractThe maximal subgroups of the finite classical groups are divided by a theorem of Aschbacher into nine classes. In this paper, the authors show how to construct those maximal subgroups of the finite classical groups of linear, symplectic or unitary type that lie in the first eight of these classes. The ninth class consists roughly of absolutely irreducible groups that are almost simple modulo scalars, other than classical groups over the same field in their natural representation. All of these constructions can be carried out in low-degree polynomial time.

2012 ◽  
Vol 19 (01) ◽  
pp. 149-158
Author(s):  
Jizhu Nan ◽  
Yufang Qin

The maximal subgroups of the finite classical groups are divided into nine classes by Aschbacher's theorem. In this paper, we give explicit transcendental bases of the invariant subfields of those maximal subgroups of classical groups of linear, symplectic and unitary cases that lie in the first two of these classes. Also, we show that the invariant rings of the maximal subgroups of the finite linear groups that lie in the first class are polynomial rings.


2012 ◽  
Vol 86 (1) ◽  
pp. 50-63 ◽  
Author(s):  
ALICE C. NIEMEYER ◽  
TOMASZ POPIEL ◽  
CHERYL E. PRAEGER

AbstractLet G be a finite d-dimensional classical group and p a prime divisor of ∣G∣ distinct from the characteristic of the natural representation. We consider a subfamily of p-singular elements in G (elements with order divisible by p) that leave invariant a subspace X of the natural G-module of dimension greater than d/2 and either act irreducibly on X or preserve a particular decomposition of X into two equal-dimensional irreducible subspaces. We proved in a recent paper that the proportion in G of these so-called p-abundant elements is at least an absolute constant multiple of the best currently known lower bound for the proportion of all p-singular elements. From a computational point of view, the p-abundant elements generalise another class of p-singular elements which underpin recognition algorithms for finite classical groups, and it is our hope that p-abundant elements might lead to improved versions of these algorithms. As a step towards this, here we present efficient algorithms to test whether a given element is p-abundant, both for a known prime p and for the case where p is not known a priori.


2006 ◽  
Vol 305 (2) ◽  
pp. 1212-1237
Author(s):  
John R. Britnell ◽  
Jason Fulman

Sign in / Sign up

Export Citation Format

Share Document