The probability of generating a finite classical group
โ Scribed by William M. Kantor; Alexander Lubotzky
- Publisher
- Springer
- Year
- 1990
- Tongue
- English
- Weight
- 954 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
โฆ Synopsis
Two randomly chosen elements of a finite simple classical group G are shown to generate G with probability --* 1 as IGI ~ co. Extensions of this result are presented, along with applications to profinite groups.
๐ SIMILAR VOLUMES
We improve Kemper's algorithm for the computation of a noetherian normalization of the invariant ring of a finite group. The new algorithm, which still works over arbitrary coefficient fields, no longer relies on algorithms for primary decomposition.
Let n q be the n-dimensional vector space over the finite field q and let G n be one of the classical groups of degree n over q . Let be any orbit of subspaces under G n . Denote by the set of subspaces which are intersections of subspaces in and assume the intersection of the empty set of subspaces
Let 1 be a thick finite generalized hexagon and let G be a group of automorphisms of 1. If G acts transitively on the set of non-degenerate ordered heptagons, then 1 is one of the Moufang hexagons H(q) or 3 H(q) associated to the Chevalley groups G 2 (q) or 3 D 4 (q) respectively, or their duals; an