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 rGr!¢. 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 P c (G) that ©x,xyª¯G, where x, y `G are chosen at random (with uniform distribution on G¬G). We shall show that P c (G)! 1 as rGr! ¢ 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. Note that our choice of x,xy amounts to choosing at random an e...
The following article appeared in Annals of Mathematics 173.2 (2011): 769-814 and may be found at ht...
We study the probability of generating a finite simple group, together with its generalisation PG,so...
We study the asymptotic behavior of the probability of generating a finite completely reducible line...
AbstractWe prove that a randomly chosen involution and a randomly chosen additional element of a fin...
Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G...
AbstractWe prove the following conjecture of J. D. Dixon: The probability that a pair of random perm...
AbstractIn earlier work it was shown that each nonabelian finite simple group G has a conjugacy clas...
For Bernd Fischer on the occasion of his 70th birthday Introduction: When G is a finite group, we ma...
For each finite simple group G there is a conjugacy class CG such that each nontrivial element of G ...
Let G be a simple algebraic group over the algebraic closure of Fp (p prime), and let G (q) denote a...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
AbstractLet G be a finite simple group. We show that a random walk on G with respect to the conjugac...
We study the asymptotic behavior of the probability of generating a finite completely reducible line...
Abstract. We give explicit, asymptotically sharp bounds for the probability that a pair of random pe...
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
The following article appeared in Annals of Mathematics 173.2 (2011): 769-814 and may be found at ht...
We study the probability of generating a finite simple group, together with its generalisation PG,so...
We study the asymptotic behavior of the probability of generating a finite completely reducible line...
AbstractWe prove that a randomly chosen involution and a randomly chosen additional element of a fin...
Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G...
AbstractWe prove the following conjecture of J. D. Dixon: The probability that a pair of random perm...
AbstractIn earlier work it was shown that each nonabelian finite simple group G has a conjugacy clas...
For Bernd Fischer on the occasion of his 70th birthday Introduction: When G is a finite group, we ma...
For each finite simple group G there is a conjugacy class CG such that each nontrivial element of G ...
Let G be a simple algebraic group over the algebraic closure of Fp (p prime), and let G (q) denote a...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
AbstractLet G be a finite simple group. We show that a random walk on G with respect to the conjugac...
We study the asymptotic behavior of the probability of generating a finite completely reducible line...
Abstract. We give explicit, asymptotically sharp bounds for the probability that a pair of random pe...
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
The following article appeared in Annals of Mathematics 173.2 (2011): 769-814 and may be found at ht...
We study the probability of generating a finite simple group, together with its generalisation PG,so...
We study the asymptotic behavior of the probability of generating a finite completely reducible line...