Publications:

Journal Articles

1. ``The block-transitive, point-imprimitive 2-(729,8,1) designs'', with Werner Nickel, Christine M. O'Keefe, Tim Penttila & Cheryl E. Praeger. Applicable Algebra in Engineering, Communication and Computing, 1992.
2. ``A Finite Soluble Quotient Algorithm". J. Symbolic Computation , 18 , 541-561, 1994.
3. ``Computing finite soluble quotients". Computational Algebra and Number Theory , (eds. Wieb Bosma and Alf van der Poorten), Kluwer, 1995.
4. ``Generating random elements of a finite group", with Frank Celler, C.R. Leedham-Green, Scott H. Murray &E.A. O'Brien, Comm. Algebra , 23 , 4931--4948, 1995.
5. ``Implementing a Recognition Algorithm for Classical Groups", with Cheryl E. Praeger, in Groups and Computation II , DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, 28 (ed. Larry Finkelstein and William M. Kantor, American Mathematical Society), 273--296, 1997.
6. ``Descriptions of groups of prime power order", with M.F. Newman & Werner Nickel, Journal of Symbolic Computation, 25 (5), 665--682, 1998.
7. ``A Recognition Algorithm for Classical Groups over Finite Fields", with Cheryl E. Praeger, in Proc. London Math. Soc. (3), 77, 117 -- 169, 1998.
8. ``Groups with Exponent six" , with George Havas, M.F. Newman, and Charles Sims, in Communications in Algebra 27, no. 8, 3619-3638, 1999.
9. ``A recognition algorithm for non-generic classical groups over finite fields", with Cheryl E. Praeger, in J. Austral. Math. Soc. (Series A)67 , 223-253, 1999.
10. ``Computing in groups with exponent six'', with George Havas, M.F. Newman and Charles C. Sims, in Computational and Geometric Aspects of Modern Algebra, Proceedings of the ICMS Workshop held at the Heriot-Watt University, Edinburgh 1998, (ed. M.D. Atkinson et al.), London Math. Soc. Lect. Notes. 275 87-100. (Cambridge Univ. Press) 2000.
11. ``Orderly generation of Rahilly families and symmetric designs with a half-regular group of automorphisms", with Priscila P. Alejandro and Anton Betten. Proceedings of the 2nd Pythagorean Conference Samos, Greece 1999, J. Geometry 67, 2-22. 2000.
12. ``Complexity and computation in matrix groups" with Cheryl E. Praeger, in Aspects of complexity. Eds: Rod Downey and Denis Hirschfeldt, de Gruyter Series in Logic and its Applications, Volume 4, de Gruyter, Berlin, pp. 87-113. 2001.
13. ``Permutations with restricted cycle structure and an algorithmic application" with Robert Beals, Charles R. Leedham-Green, Cheryl E. Praeger and Akos Seress in Combinatorics, Probability and Computing 11, 447-464. 2002.
14. ``Recognising Matrix groups", with Charles R. Leedham-Green, E.A. O'Brien and Cheryl E. Praeger, in Computer Algebra Handbook, Foundations, Applications, Systems. Ed. J. Grabmeier, E. Kaltofen, V. Weispfenning, Springer-Verlag, Berlin New York pp. 474-475. 2003.
15. ``ANU polycyclic quotient programs'', with M.F. Newman, Werner Nickel and E.A. O'Brien, in Computer Algebra Handbook, Foundations, Applications, Systems. Ed. J. Grabmeier, E. Kaltofen, V. Weispfenning, Springer-Verlag, Berlin New York pp.459-460. 2003.
16. ``A black box algorithm for recognising finite symmetric and alternating groups, I" with Robert Beals, Charles R. Leedham-Green, Cheryl E. Praeger and Akos Seress, Trans. Amer. Math. Soc. 355
,pp. 2097-2113 (electronic) 2003.
17. ``On a theorem of Wielandt for primitive permutation groups" with Anton Betten, Anne Delandtsheer and Cheryl E. Praeger, J. Group Theory 6 , 415-420, 2003.
18. ``Finite line-transitive linear spaces: parameters and normal point-partitions" with Anne Delandtsheer and Cheryl E. Praeger, Advances in Geometry 3 , 469-485, 2003.
19. ``A constructive recognition algorithm for normalisers of small extra special-groups as matrix groups". International Journal of Algebra and Computation, Vol. 15, No. 2, 367-394, 2005.
20. ``Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules." with Robert Beals, Charles R. Leedham-Green, Cheryl E. Praeger and Akos Seress. J. Algebra, Vol 92, no. 1, 4--46, 2005.
21. ``A search algorithm for line-transitive point-imprimitive linear spaces" with Anton Betten, Greg Cresp and Cheryl E. Praeger. Bayreuther Mathematischen Schriften, 2005.
22. ``A reduction algorithm for large-base primitive permutation groups" with Maska Law, Cheryl E. Praeger and Akos Seress. LMS J. of Computation and Mathematics , 9, 159--173, 2006.
23. ``On the frequency of permutations containing a long cycle" with Cheryl E. Praeger. Journal of Algebra, 300(1). 2006.
24. ``On the lengths of pairs of complex matrices of size at most five", with W.E. Longstaff and Oreste Panaia. Bulletin of the Australian Mathematical Society, 73 , 461--472, 2006.
25. ``A reduction algorithm for matrix groups with an extraspecial normal subgroup", with Peter Brooksbank and Akos Seress, proceedings of ``Finite Geometries, Groups, and Computation". Eds. A. Hulpke, R. Liebler, T. Penttila, \'A. Seress. deGruyter, 1--16, 2006.
26. ``The minimum length of a base for the symmetric group acting on partitions" with Carmit Benbenishty and Jonathan Cohen. European Journal of Combinatorics 28 , 6, 1553-1876, 2007.
27. ``On Permutations of Order Dividing a Given Integer" with Cheryl E. Praeger. Journal of Algebraic Combinatorics. 26 (1), 125--142, 2007.
28. ``On the proportion of permutations of order a multiple of the degree" with Cheryl E. Praeger. Journal of the London Math. Soc. (2) 76 no. 3, 622--632, 2007.
29. ``Apportionment Methods", with Horst F. Niemeyer. Mathematical Social Sciences 56, 240-253, 2008.
30. ``Finding involutions in finite Lie type groups of odd characteristic'', with Frank L"ubeck and Cheryl E. Praeger. J. Algebra 2009.
31. ``Finite line-transitive linear spaces: Theory and search strategies", with Anton Betten, Anne Delandtsheer, Maska Law, Cheryl E. Praeger and Shenglin Zhou. Acta Mathematica Sinica 25 (9), Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society, co-published with Springer-Verlag GmbH 1399-1436, DOI 10.1007/s10114-009-9275-0, 2009.

accepted

submitted

• ``An infinite polycyclic quotient algorithm" with Bettina Eick and Oreste Panaia.
• ``A hybrid quotient algorithm", with Alexander Hulpke.
• An explicit version of a theorem of Erd"os and Tur'an on random permutations", with Cheryl E. Praeger.
• Estimating proportions of elements in finite simple groups of Lie type, with Cheryl E. Praeger.
• On proportions of pre-involutions in finite classical groups, with Tomasz Popiel and Cheryl E. Praeger.

Research Reports (not appearing elsewhere)

1. ``Two families of block-transitive point-imprimitive designs'', with Werner Nickel, Research Report No SMS-022-90 Mathematics Research Section School of Mathematical Sciences ANU, 1990.
2. ``The p-Quotient Algorithm in GAP", with Frank Celler, M.F. Newman & Werner Nickel. Research Report No SMS-127-93 Mathematics Research Section School of Mathematical Sciences ANU, 1993.

other publications

• M. Sch"onert et al. ``GAP Getting started and reference manual " Lehrstuhl D f"ur Mathematik der RWTH Aachen, 1994.
• Cheryl E. Praeger with assistance of Cai Heng Li and Alice C. Niemeyer. ``Finite transitive permutation groups and finite vertex-transitive graphs.'' Graph symmetry (Montreal, PQ, 1996), 277--318, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 497, Kluwer Acad. Publ., Dordrecht, 1997.

Non-mathematical Publications

• ``Designing Step Routines". Fitness Focus, Fitness Western Australia Inc, Issue No. 62, September 2000.
• ``Seminar presentation skills and university communication''. With Judy Recher.

Last Updated: May 2008