Skip to main content Accessibility help
×
Hostname: page-component-788cddb947-nxk7g Total loading time: 0 Render date: 2024-10-10T16:37:20.608Z Has data issue: false hasContentIssue false

Recent progress in the symmetric generation of groups

Published online by Cambridge University Press:  05 July 2011

Ben Fairbairn
Affiliation:
Universidad de Los Andes
C. M. Campbell
Affiliation:
University of St Andrews, Scotland
M. R. Quick
Affiliation:
University of St Andrews, Scotland
E. F. Robertson
Affiliation:
University of St Andrews, Scotland
C. M. Roney-Dougal
Affiliation:
University of St Andrews, Scotland
G. C. Smith
Affiliation:
University of Bath
G. Traustason
Affiliation:
University of Bath
Get access

Summary

Abstract

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for groups and practically by providing succinct means of representing group elements. We give a survey of results obtained in the study of these symmetric generating sets. In keeping with earlier surveys on this matter, we emphasize the sporadic simple groups.

Introduction

This article is concerned with groups that are generated by highly symmetric subsets of their elements: that is to say by subsets of elements whose set normalizer within the group they generate acts on them by conjugation in a highly symmetric manner. Rather than investigate the behaviour of known groups we turn this procedure around and ask what groups can be generated by a set of elements that possesses a certain assigned set of symmetries. This enables constructions by hand of a number of interesting groups, including many of the sporadic simple groups. Much of the emphasis of the research project to date has been concerned with using these techniques to construct sporadic simple groups, and this article will emphasize this important special case. Recent work of the author and Müller has been concerned with Coxeter groups, so we shall describe this case too.

This article is intended as an ‘update’ to the earlier survey article of Curtis [14]. Since [14] appeared several of the larger sporadic groups have succumbed to these techniques and a much wider class of reflections groups have been found to admit symmetric presentations corresponding to symmetric generating sets.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2011

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.)

References

[1] S. W., Bolt, Some applications of symmetric generation (PhD thesis, Birmingham 2002).
[2] S. W., Bolt, J. N., Bray and R. T., Curtis, Symmetric presentation of the Janko group J4, J. London Math. Soc. (2) 76 (2007), 683–701.Google Scholar
[3] W., Bosma, J., Cannon and C., Playoust, The Magma algebra system, I: the user language, J. Symbolic Comput. 24 (1997), 235–265.Google Scholar
[4] J. D., Bradley, Symmetric presentations of sporadic groups (PhD thesis, Birmingham 2004).
[5] J. D., Bradley and R. T., Curtis, Symmetric generation and existence of J3 : 2, the automorphism group of the third Janko group, J. Algebra 304 (2006), 256–270.Google Scholar
[6] J. N., Bray, Symmetric generation of sporadic groups and related topics (PhD thesis, Birmingham 1997).
[7] J. N., Bray and R. T., Curtis, Double coset enumeration of symmetrically generated groups, J. Group Theory 7 (2004), 167–185.Google Scholar
[8] J. N., Bray and R. T., Curtis, The Leech lattice, ∧ and the Conway group ·0 revisited, Trans. Amer. Math. Soc. to appear.
[9] J. N., Bray, R. T., Curtis, C. W., Parker and C. B., Wiedorn, Symmetric presentations for the Fischer groups I: the classical groups Sp6 (2), Sp8 (2), and 3·O7 (3), J. Algebra 265 (2003), 171–199.Google Scholar
[10] J. N., Bray, R. T., Curtis, C. W., Parker and C. B., Wiedorn, Symmetric presentations for the Fischer groups II: the sporadic groups, Geom. Dedicata 112 (2005), 1–23.Google Scholar
[11] J. H., Conway, A group of order 8,315,553,613,086,720,000, Bull. Lond. Math. Soc. 1 (1969), 79–88.Google Scholar
[12] J. H., Conway, R. T., Curtis, S. P., Norton, R. A., Parker and R. A., Wilson, Atlas of Finite Groups (CUP, Oxford 1985).Google Scholar
[13] J. H., Conway and N. J. A., Sloane, Sphere Packing, Lattices and Groups, Third edition, Grundlehren der mathematischen Wissenschaften 290 (Springer–Verlag, New York 1998).Google Scholar
[14] R. T., Curtis, A survey of symmetric generation of sporadic simple groups, in The Atlas of Finite Groups: ten years on (R. T., Curtis and R. A., Wilson, eds.), London Math. Soc. Lecture Note Ser. 249 (CUP, Cambridge 1998), 39–57.Google Scholar
[15] R. T., CurtisSymmetric generation of groups, with applications to many of the sporadic finite simple groups, Encyclopedia of Mathematics and Its Applications 111 (CUP, Cambridge 2007).Google Scholar
[16] R. T., Curtis and B. T., Fairbairn, Symmetric representation of the elements of the Conway group ·0, J. Symbolic Comput. 44 (2009), 1044–1067.Google Scholar
[17] D. Ž., Djoković and J., Malzan, Monomial irreducible characters of the symmetric and alternating groups, J. Algebra 35 (1975), 153–158.Google Scholar
[18] D. Ž., Djoković and J., Malzan, Imprimitive, irreducible complex characters of the alternating groups, Canad. J. Math. 28 (1976), 1199–1204.Google Scholar
[19] B. T., Fairbairn, A note on monomial representations of linear groups, Comm. Algebra to appear.
[20] B. T., Fairbairn and J., Müller, Symmetric generation of Coxeter groups, Arch. Math (Basel) to appear, http://arxiv.org/abs/0901.2660.
[21] B. T., Fairbairn, On the symmetric generation of finite groups (PhD thesis, Birmingham 2009).
[22] B. T., Fairbairn, Symmetric presentations of Coxeter groups, preprint.
[23] M. S., Mohamed, Computational methods in symmetric generation of groups (PhD thesis, Birmingham 1998).
[24] J. A., Todd and H. S. M., Coxeter, A practical method for enumerating cosets of finite abstract groups, Proc. Edinb. Math. Soc. 5 (1936), 26–34.Google Scholar
[25] S., Whyte, Symmetric generation: permutation images and irreducible monomial representations (PhD thesis, Birmingham 2006).

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×