Random Generation of the Special Linear Group

Abstract

It is well known that the proportion of pairs of elements of SL(n,q) which generate the group tends to 1 as qn ∞. This was proved by Kantor and Lubotzky using the classification of finite simple groups. We give a proof of this theorem which does not depend on the classification. An essential step in our proof is an estimate for the average of 1/ord g when g ranges over GL(n,q), which may be of independent interest. We prove that this average is \[ (-(2-o(1)) n n q). \]

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…