Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-28T03:20:29.039Z Has data issue: false hasContentIssue false

RANDOM GENERATION OF SIMPLE GROUPS BY TWO CONJUGATE ELEMENTS

Published online by Cambridge University Press:  01 September 1997

ANER SHALEV
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem 91904, Israel
Get access

Abstract

Let G be a finite simple group. A conjecture of J. D. Dixon, which is now a theorem (see [2, 5, 9]), states that the probability that two randomly chosen elements x, y of G generate G tends to 1 as [mid ]G[mid ]→∞. Geoff Robinson asked whether the conclusion still holds if we require further that x, y are conjugate in G. In this note we study the probability Pc(G) that 〈x, xy〉=G, where x, yG are chosen at random (with uniform distribution on G×G). We shall show that Pc(G)→1 as [mid ]G[mid ]→∞ if G is an alternating group, or a projective special linear group, or a classical group of bounded dimension. In fact, some (but not all) of the exceptional groups of Lie type will also be dealt with.

Type
Research Article
Copyright
© The London Mathematical Society 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)