Skip to main content Accessibility help
×
Home
Hostname: page-component-684bc48f8b-mkrr2 Total loading time: 1.115 Render date: 2021-04-13T14:54:18.008Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

BEHIND AND BEYOND A THEOREM ON GROUPS RELATED TO TRIVALENT GRAPHS

Published online by Cambridge University Press:  01 December 2008

GEORGE HAVAS
Affiliation:
ARC Centre for Complex Systems, School of Information Technology and Electrical Engineering, The University of Queensland, Queensland 4072, Australia (email: havas@itee.uq.edu.au)
EDMUND F. ROBERTSON
Affiliation:
School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, Scotland (email: efr@st-andrews.ac.uk)
DALE C. SUTHERLAND
Affiliation:
School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, Scotland
Corresponding
Rights & Permissions[Opens in a new window]

Abstract

In 2006 we completed the proof of a five-part conjecture that was made in 1977 about a family of groups related to trivalent graphs. This family covers all 2-generator, 2-relator groups where one relator specifies that a generator is an involution and the other relator has three syllables. Our proof relies upon detailed but general computations in the groups under question. The proof is theoretical, but based upon explicit proofs produced by machine for individual cases. Here we explain how we derived the general proofs from specific cases. The conjecture essentially addressed only the finite groups in the family. Here we extend the results to infinite groups, effectively determining when members of this family of finitely presented groups are simply isomorphic to a specific quotient.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2009

Footnotes

This research was partially supported by the Australian Research Council and by the Engineering and Physical Sciences Research Council grant EP/C523229/01, ‘Multidisciplinary Critical Mass in Computational Algebra and Applications’.

References

[1]Bosma, W., Cannon, J. and Playoust, C., ‘The Magma algebra system I: the user language’, J. Symbolic Comput. 24 (1997), 235265. See also http://www.maths.usyd.edu.au:8000/u/magma/.CrossRefGoogle Scholar
[2]Campbell, C. M., Coxeter, H. S. M. and Robertson, E. F., ‘Some families of finite groups having two generators and two relations’, Proc. Roy. Soc. Lond. Ser. A 357 (1977), 423438.CrossRefGoogle Scholar
[3]Campbell, C. M. and Robertson, E. F., ‘On 2-generator 2-relation soluble groups’, Proc. Edinb. Math. Soc. (2) 23 (1980), 269273.CrossRefGoogle Scholar
[4]Campbell, C. M. and Robertson, E. F., ‘Groups related to F a,b,c involving Fibonacci numbers’, in: The Geometric Vein (Springer, New York, 1981), pp. 569576.CrossRefGoogle Scholar
[5] The GAP Group, GAP   Groups, Algorithms, and Programming, Version 4.4, 2004. See also http://www.gap-system.org/.Google Scholar
[6]Havas, G. and Ramsay, C., ‘On proofs in finitely presented groups’, in: Groups, St Andrews, 2005, London Mathematical Society Lecture Note Series, 340 (Cambridge University Press, Cambridge, 2007), pp. 457474.CrossRefGoogle Scholar
[7]Havas, G. and Robertson, E. F., ‘The F a,b,c conjecture, I’, Irish Math. Soc. Bull. 56 (2005), 7580.Google Scholar
[8]Havas, G., Robertson, E. F. and Sutherland, D. C., ‘The F a,b,c conjecture is true, II’, J. Algebra 300 (2006), 5772.CrossRefGoogle Scholar
[9]Leech, J., ‘Computer proof of relations in groups’, in: Topics in Group Theory and Computation (Academic Press, New York, 1977), pp. 3861.Google Scholar
[10]Ramsay, C., PEACE 1.100: Proof Extraction After Coset Enumeration, Technical Report 22, Centre for Discrete Mathematics and Computing, The University of Queensland, 2003.Google Scholar
[11]Sutherland, D. C., ‘Computer-assisted proofs and the F a,b,c conjecture’, PhD Thesis, University of St Andrews, 2005.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: 99 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 13th April 2021. This data will be updated every 24 hours.

Access Access

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.

BEHIND AND BEYOND A THEOREM ON GROUPS RELATED TO TRIVALENT GRAPHS
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.

BEHIND AND BEYOND A THEOREM ON GROUPS RELATED TO TRIVALENT GRAPHS
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.

BEHIND AND BEYOND A THEOREM ON GROUPS RELATED TO TRIVALENT GRAPHS
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *