1995
DOI: 10.1006/jabr.1995.1238
|View full text |Cite
|
Sign up to set email alerts
|

On the Probability That a Group Element is p-Singular

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

1997
1997
2016
2016

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(28 citation statements)
references
References 16 publications
0
28
0
Order By: Relevance
“…We may improve the first assertion of Theorem 5.2 of [IKS95] for finite classical groups using Lemma 2.3 and our discussion in Section 5 on the structure of maximal tori in these groups. Let I be the set of all involutions in a finite classical group G in odd characteristic.…”
Section: Strategy Of Countingmentioning
confidence: 95%
“…We may improve the first assertion of Theorem 5.2 of [IKS95] for finite classical groups using Lemma 2.3 and our discussion in Section 5 on the structure of maximal tori in these groups. Let I be the set of all involutions in a finite classical group G in odd characteristic.…”
Section: Strategy Of Countingmentioning
confidence: 95%
“…The same general approach was applied also in the 1995 paper [4] of Isaacs, Kantor and Spaltenstein proving their stunning theorem bounding below the proportion of p-singular elements in finite permutation groups, and also in the 2005 paper of Cohen and Murray to estimate the proportion of regular semisimple elements in the Lie algebra of a connected reductive algebraic group (see [2,Section 6]) in order to analyse their Las Vegas 'algorithm for Lang's Theorem'.…”
Section: Introductionmentioning
confidence: 94%
“…Recall that g ∈ G is p-singular if its order is divisible by p. As Isaacs, Kantor & Spaltenstein [63] and Guralnick & Lübeck [52] show, a group of Lie type in defining characteristic p has a small proportion of p-singular elements. …”
Section: Theorem 81 There Is a Las Vegas Algorithm Which When Givenmentioning
confidence: 99%