2013
DOI: 10.1080/00927872.2012.729629
|View full text |Cite
|
Sign up to set email alerts
|

On Generators and Representations of the Sporadic Simple Groups

Abstract: In this paper we determine the irreducible projective representations of sporadic simple groups over an arbitrary algebraically closed field F , whose image contains an almost cyclic matrix of prime-power order. A matrix M is called cyclic if its characteristic and minimum polynomials coincide, and we call M almost cyclic if, for a suitable α ∈ F , M is similar to diag(α · Id h , M1), where M1 is cyclic and 0 ≤ h ≤ n. The paper also contains results on the generation of sporadic simple groups by minimal sets o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
16
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(16 citation statements)
references
References 15 publications
0
16
0
Order By: Relevance
“…For n > 2, we get that φ(g) is not almost cyclic by Lemma 2.3 once we show that 2n|g| < q n −1 2 . Now, 2n|g| ≤ 2n · 2 t+1 (q + 1) ≤ 4n 2 (q + 1) and 4n 2 (q + 1) < q n −1 2 for all n ≥ 3 and q odd, unless (n, q) ∈ {(3, 3), (3,5), (3,7), (4, 3), (4, 5), (5, 3), (6, 3)}. For L as listed in the table below, using the GAP package we get the following: Thus in these cases, by Lemma 2.3, we conclude that φ(g) is not almost cyclic.…”
Section: (Q+1)mentioning
confidence: 99%
See 4 more Smart Citations
“…For n > 2, we get that φ(g) is not almost cyclic by Lemma 2.3 once we show that 2n|g| < q n −1 2 . Now, 2n|g| ≤ 2n · 2 t+1 (q + 1) ≤ 4n 2 (q + 1) and 4n 2 (q + 1) < q n −1 2 for all n ≥ 3 and q odd, unless (n, q) ∈ {(3, 3), (3,5), (3,7), (4, 3), (4, 5), (5, 3), (6, 3)}. For L as listed in the table below, using the GAP package we get the following: Thus in these cases, by Lemma 2.3, we conclude that φ(g) is not almost cyclic.…”
Section: (Q+1)mentioning
confidence: 99%
“…where p m = |Φ| p . Then, by Lemma 3.1, |g| ≤ p t+m |q (since e < p).If m ≥ 1 and (n, q) = (4, 8),(5,8), then n 2 p m (q…”
mentioning
confidence: 95%
See 3 more Smart Citations