Generating Random Elements of a Finite Group

Communications in Algebra

Volumn 23, Issue 13, 1995, Pages 4931-4948

  Frank, Celler ^a   Leedham Green, Charles R ^b   Murray, Scott H ^c   Niemeyer, Alice C ^d   O'Brien, E A ^e  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF CHICAGO   (United States)

^d UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

^e AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844515117     PISSN: 00927872     EISSN: 15324125     Source Type: Journal    
DOI: 10.1080/00927879508825509     Document Type: Article

References (20)

1. M. Aschbacher (1984), “On the maximal subgroups of the finite classical groups”, Invent. Math., 76, 469–514.
2. László Babai (1991), “Local expansion of vertex-transitive graphs and random generation in finite groups”, Theory of Computing, (Los Angeles, 1991), pp. 164–174. Association for Computing Machinery, New York.
3. László Babai, Robert Beals and Daniel Rockmore (1993), “Deciding finiteness of matrix groups in deterministic polynomial time”, Proc. 1993 International Symposium on Symbolic and Algebraic Computation, pp. 117–126. ACM Press, New York.
4. Wieb Bosma and John Cannon (1993), Handbook of MAGMA functions. Department of Pure Mathematics, Sydney University.
5. Frank Celler and C.R. Leedham-Green (in preparation), “Non-constructive classical group recognition”.
6. J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker and R.A. Wilson (1985), Atlas of finite groups. Clarendon Press, Oxford.
7. Persi Diaconis and Laurent Saloff-Coste (1993), “Comparison techniques for random walk on finite groups”, Ann. Probab., 21, 2131-2156.
8. P. Diaconis and L. Saloff-Coste (1994), “Moderate growth and random walk on finite groups”, Geom. Funct. Anal., 4, 1–36.
9. Geoffrey Grimmett and David Stirzaker (1982), Probability and Random Processes. Oxford University Press, London.
10. Derek F. Holt, Charles R. Leedham-Green, E.A. O'Brien and Sarah Rees (1994), “Primitivity testing for matrix groups”, preprint.
11. Derek F. Holt and Sarah Rees (1992), “An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups”, J. Experimental Math., 1, 237–242.
12. W.M. Kantor and A. Lubotzky (1990), “The probability of generating a finite classical group”, Geom. Dedicata, 36, 67–87.
13. Peter Kleidman and Martin Liebeck (1990), The Subgroup Structure of the Finite Classical Groups, London Math. Soc. Lecture Note Ser., 129. Cambridge University Press.
14. Martin W. Liebeck and Aner Shalev (to appear), “The probability of generating a finite simple group”, Geom. Dedicata.
15. Peter M. Neumann and Cheryl E. Praeger (1992), “A recognition algorithm for special linear groups”, Proc. London Math. Soc. (3), 65, 555–603.
16. Peter M. Neumann and Cheryl E. Praeger (in preparation), “Cyclic matrices over finite fields”.
17. Harald Niederreiter (1992), Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, 63. SIAM, Philadelphia.
18. Alice C. Niemeyer and Cheryl E. Praeger (in preparation), “Recognising classical groups”.
19. Tim Penttila, Cheryl E. Praeger and Jan Saxl (in preparation), “Linear groups with orders divisible by certain large primes”.
20. Martin Schonert et al. (1994), GAP - Groups, Algorithms and Programming. Lehrstuhl D für Mathematik, RWTH, Aachen.