Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
EnglishFrançais
Journal of the Australian Mathematical Society Journal of the Australian Mathematical Society

Article contents

ON THE GENERATING GRAPH OF A SIMPLE GROUP

Part of: Probabilistic methods in group theory Representation theory of groups

Published online by Cambridge University Press:  26 September 2016

ANDREA LUCCHINI ,
ATTILA MARÓTI  and
COLVA M. RONEY-DOUGAL
ANDREA LUCCHINI
Affiliation:
Dipartimento di Matematica, Università degli studi di Padova, Via Trieste 63, 35121 Padova, Italy email lucchini@math.unipd.it
ATTILA MARÓTI
Affiliation:
MTA Alfréd Rényi Institute of Mathematics, Reáltanoda utca 13–15, H-1053, Budapest, Hungary email maroti.attila@renyi.mta.hu
COLVA M. RONEY-DOUGAL
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews, Fife KY16 9SS, UK email colva.roney-dougal@st-andrews.ac.uk
Corresponding
E-mail address:
lucchini@math.unipd.it
maroti.attila@renyi.mta.hu
colva.roney-dougal@st-andrews.ac.uk
Get access
Rights & Permissions[Opens in a new window]

Abstract

The generating graph $\unicode[STIX]{x1D6E4}(H)$ of a finite group $H$ is the graph defined on the elements of $H$ , with an edge between two vertices if and only if they generate $H$ . We show that if $H$ is a sufficiently large simple group with $\unicode[STIX]{x1D6E4}(G)\cong \unicode[STIX]{x1D6E4}(H)$ for a finite group $G$ , then $G\cong H$ . We also prove that the generating graph of a symmetric group determines the group.

Keywords

generating graph finite group

MSC classification

Primary: 20D06: Simple groups
Secondary: 20P05: Probabilistic methods in group theory
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 103 , Issue 1 , August 2017 , pp. 91 - 103
Copyright
© 2016 Australian Mathematical Publishing Association Inc. 

Access options

Get access to the full version of this content by using one of the access options below.
If you should have access and can't see this content please contact technical support.

Footnotes

The authors were supported by Università di Padova (Progetto di Ricerca di Ateneo: Invariable generation of groups). The second author was also supported by an Alexander von Humboldt Fellowship for Experienced Researchers, by OTKA grants K84233 and K115799, and by the MTA Rényi Lendület Groups and Graphs Research Group.

References

Aschbacher, M., Finite Group Theory, Cambridge Studies in Advanced Mathematics, 10 (Cambridge University Press, Cambridge, 1986).Google Scholar
Bray, J. N., Holt, D. F. and Roney-Dougal, C. M., The Maximal Subgroups of the Low-Dimensional Finite Classical Groups, London Mathematical Society Lecture Note Series, 407 (Cambridge University Press, Cambridge, 2013).CrossRefGoogle Scholar
Breuer, T., Guralnick, R. M. and Kantor, W. M., ‘Probabilistic generation of finite simple groups. II’, J. Algebra 320(2) (2008), 443–494.CrossRefGoogle Scholar
Burness, T. C. and Guest, S., ‘On the uniform spread of almost simple linear groups’, Nagoya Math. J. 209 (2013), 35–109.CrossRefGoogle Scholar
Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. A. and Wilson, R. A., An ATLAS of Finite Groups (Clarendon Press, Oxford, 1985), reprinted with corrections 2003.Google Scholar
The GAP Group, GAP – ‘Groups, Algorithms, and Programming’, Version 4.7.7, 2015. http://www.gap-system.org.Google Scholar
Guralnick, R. M., ‘The spread of finite groups’, in preparation.Google Scholar
Guralnick, R. M. and Kantor, W. M., ‘Probabilistic generation of finite simple groups. Special issue in honor of Helmut Wielandt’, J. Algebra 234(2) (2000), 743–792.CrossRefGoogle Scholar
Häsä, J., ‘Growth of cross-characteristic representations of finite quasisimple groups of Lie type’, J. Algebra 407 (2014), 275–306.CrossRefGoogle Scholar
Kimmerle, W., Lyons, R., Sandling, R. and Teague, D. N., ‘Composition factors from the group ring and Artin’s theorem on orders of simple groups’, Proc. Lond. Math. Soc. (3) 60 (1990), 89–122.CrossRefGoogle Scholar
Kleidman, P. B. and Liebeck, M. W., The Subgroup Structure of the Finite Classical Groups, London Mathematical Society Lecture Note Series, 129 (Cambridge University Press, Cambridge, 1990).CrossRefGoogle Scholar
Liebeck, M. W., ‘On the orders of maximal subgroups of the finite classical groups’, Proc. Lond. Math. Soc. (3) 50 (1985), 426–446.CrossRefGoogle Scholar
Liebeck, M. W. and Shalev, A., ‘Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky’, J. Algebra 184(1) (1996), 31–57.CrossRefGoogle Scholar
Maróti, A., ‘On the orders of primitive groups’, J. Algebra 258(2) (2002), 631–640.CrossRefGoogle Scholar
Menezes, N. E., ‘Random generation and chief length of finite groups’, PhD Thesis, University of St Andrews, 2013.Google Scholar
Menezes, N. E., Quick, M. and Roney-Dougal, C. M., ‘The probability of generating a finite simple group’, Israel J. Math. 198(1) (2013), 371–392.CrossRefGoogle Scholar
Piccard, S., ‘Sur les bases du groupe symétrique et du groupe alternant’, Math. Ann. 116(1) (1939), 752–767.CrossRefGoogle Scholar
Taylor, D. E., The Geometry of the Classical Groups (Heldermann, Berlin, 1992).Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 129 *
View data table for this chart

* Views captured on Cambridge Core between 26th September 2016 - 23rd January 2021. This data will be updated every 24 hours.

3 Cited by
Hostname: page-component-76cb886bbf-m9qpn Total loading time: 0.257 Render date: 2021-01-23T03:08:50.466Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@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 sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent 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.

ON THE GENERATING GRAPH OF A SIMPLE GROUP
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and 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 <service> account. Find out more about sending content to Dropbox.

ON THE GENERATING GRAPH OF A SIMPLE GROUP
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and 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 <service> account. Find out more about sending content to Google Drive.

ON THE GENERATING GRAPH OF A SIMPLE GROUP
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *