Permutation Groups: Misprints, Corrections, Improvements


Updated references:

[9] László Babai and Peter J. Cameron, Automorphisms and enumeration of switching classes of tournaments, Electronic J. Combinatorics 7 (2000), #38 (25pp.)
[12] R. A. Bailey, Association Schemes: Designed Experiments, Algebra and Combinatorics, Cambridge Studies in Advanced Mathematics, Cambridge University Press, 2004.
[48] Peter J. Cameron and Csaba Szabó, Independence algebras, J. London Math. Soc. (2) 61 (2000), 321-334.
[81] L. A. Goldberg and M. R. Jerrum, The "Burnside process' converges slowly, in: Proceedings of Random 1998, Randomisation and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1518, Springer-Verlag, pp. 331-345.
[119] Martin W. Liebeck and Aner Shalev, Simple groups, permutation groups, and probability, J. Amer. Math. Soc. 12 (1999), 497-520.
[131] Dugald Macpherson, Sharply multiply homogeneous permutation groups, and rational scale types, Forum Math. 8 (1996), 501-507.
[165] Ákos Seress, Permutation Group Algorithms, Cambridge Tracts in Mathematics 152, Cambridge University Press, 2003.

Please email corrections to me: p.j.cameron(at) or (preferred) pjc20(at)

Book homepage | Permutation groups resources

Peter J. Cameron
17 January 2016.