A Generation Criterion for Subsets of SLn(Fq)

Abstract

Let G0 be a either SLn(Fq), the special linear group over the finite field with q elements, or PSLn(Fq), its projective quotient, and let be a symmetric subset of G0, namely, if x ∈ then x-1 ∈ . We find a certain set R(G0) of irreducible representations of G0 whose size is at most 5, such that generates G0 if and only if is not an eigenvalue of Σσ ∈ (σ) for every ∈ R(G0). To achieve this result, let G be either GLn(Fq) or PGLn(Fq). We consider X(G), some set of irreducible nontrivial characters of G, whose size is at most 5. We show that for every subgroup K G that does not contain G0, the restriction to K of at least one of the characters in X(G) contains the trivial character as an irreducible summand. We then restrict the characters to G0 and use standard arguments about the Cayley graph of G to imply the result. In addition, we obtain slightly weaker results about the generation of symmetric subsets of G. We finish by considering Sn, the symmetric group on n elements, and presenting R(Sn), a set of eight irreducible nontrivial representations of Sn, such that a symmetric subset ⊂eq Sn generates Sn if and only if is not an eigenvalue of Σσ ∈ (σ) for every ∈ R(Sn), which is an improvement upon the previously known set of 12 irreducible nontrivial representations of Sn that satisfies this condition.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…