Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-06-15T18:25:49.331Z Has data issue: false hasContentIssue false

Some challenging group presentations

Published online by Cambridge University Press:  09 April 2009

George Havas
Centre for Discrete Mathematics and Computing Computer Science and Electrical Engineering University of Queensland, Qld 4072Australia e-mail:
Derek F. Holt
Mathmatics Institute University of Warwick Conventry CV4 7AL UK e-mail:
P. E. Kenne
Electrical and Electronic Engineering The University of Adelaide SA 5005 Australia e-mail:
Sarah Rees
Mathematics and Statistics University of Newcastle Newcastle upon Tyne NEI 7RU UK e-mail:
Rights & Permissions [Opens in a new window]


Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We study some challenging presentations which arise as groups of deficiency zero. In four cases we settle finiteness: we show that two presentations are for finite groups while two are for infinite groups. Thus we answer three explicit questions in the literature and we provide the first published deficiency zero presentation for a group with derived length seven. The tools we use are coset enumeration and Knuth-Bebdix rewriting, which are well-established as methods for proving finiteness or otherwise of a finitely presented group. We briefly comment on their capabilities and compare their performance.

Research Article
Copyright © Australian Mathematical Society 1999


[1]Bosma, W., Cannon, J. and Playoust, C., ‘The MAGMA algebra system I: The user language’, J. Symbolic Comput. 24 (1997), 235265.CrossRefGoogle Scholar
[2]Brückner, H., Algorithmen für endliche auflösbare Gruppen und Anwendungen (Ph.D. Thesis, Aachener Beiträge zur Mathematik, Band 22, Verlag der Augudtinus Buchhandlung, 1998).Google Scholar
[3]Campbell, C. M. and Robertson, E. F., ‘Presentations for the simple groups G, 105 < |G| < 106’, Comm. Algebra 12 (1984), 26432663.CrossRefGoogle Scholar
[4]Cannon, J. and Havas, G., ‘Algorithms for groups’, Austral. Compouter Journal 24 (1992), 5160.Google Scholar
[5]Epstein, D. B. A., Holt, D. F. and Rees, S. E., ‘The use of Knuth-Bendix methods to solve the word problem in automatic groups’, J. Symbolic Comput. 12 (1991), 397414.CrossRefGoogle Scholar
[6]Gilman, R. H., ‘Presentations of groups and monoids’, J. Algebra 57 (1979), 544554.CrossRefGoogle Scholar
[8]Havas, G., ‘Coset enumeration strategies’, in: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation (ACM Press, New York, 1991) pp. 191199.CrossRefGoogle Scholar
[9]Havas, G., Newman, M. F. and O'Brien, E. A., ‘Groups of deficiency zero’, in: Geometric and computational perpectives on infinite groups, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 25 (1996) pp. 5367.Google Scholar
[10]Havas, G. and Ramsay, C., Coset enumeration: ACE version 3 (1999), Available as Scholar
[11]Havas, G. and Ramsay, C., ‘Experiments in coset enumeration’, Centre for Discrete Mathmatics and Computing Report 13 (The University of Queensland, 1999).Google Scholar
[12]Holt, D. F., ‘An alternative proof that the Fibonacci group F(2, 9) is infinite’, Experiment. Math. 4 (1995), 97100.CrossRefGoogle Scholar
[13]Holt, D. F., KBMAG Knuth-Bendix in monoids and automatic groups, software package (1996), Available from Scholar
[14]Holt, D. F. and Hurt, D. F., ‘Automatic coset systems and subgroup presentations’, J. Symbolic Comput. 27 (1999), 119.CrossRefGoogle Scholar
[15]Johnson, D. L. and Robertson, E. F., ‘Finite groups of deficiency zero’, in: Homological group theory, London Math. Soc. Lecture Note Ser. 36 (Cambridge University Press, Cambridge, 1979) pp. 275289.CrossRefGoogle Scholar
[16]Kenne, P. E., ‘Some new efficient soluble groups’, Comm. Algebra 18 (1990), 27472753.CrossRefGoogle Scholar
[17]Kenne, P. E., Minimal group presentations: a computational approach (Ph.D. Thesis, Australian National University, 1991).Google Scholar
[18]Knuth, D. E. and Bendix, P. B., ‘Simple word problems in elementary algebra’, in: Computational problems in abstract algebra (Pergamon Press, Oxford, 1970) pp. 263297.Google Scholar
[19]Leech, J., ‘Coset enumeration on digital computers’, Proc. Camb. Phil. Soc. 59 (1963), 257267.CrossRefGoogle Scholar
[20]Mazurov, V. D. and Khukhro, E. I. (eds.), The Kourovka notebook: unsolved problems on group theory, 13th Edition (Akad. Nauk SSSR Sibirsk.Otdel., Inst. Mat., Novosibirsk, 1995).Google Scholar
[21]Mendelsohn, N. S., ‘An algorithmic solution for a word problem in group theory’, Canad. J. Math. 16 (1964), 509516 Correction, Canad. J. Math. 17 (1965) 505.CrossRefGoogle Scholar
[22]Moore, E. H., ‘Concerning the abstract groups of order k! abd ½k! holohedrically isomorphic with the symmetric and the alternating substitution-groups on k letters’, Proc. London Math. Soc. 28 (1897), 357366.Google Scholar
[23]Plesken, W., ’, J. Symbolic Comput. 4 (1987), 111122.CrossRefGoogle Scholar
[24]Schönert, M. et al. , GAP – Groups, algorithms, and programming, Lehrstuhl D für Mathematik, 5th Edition (Rheinisch Westfälische Technische Hochschule, Aachen, Germany, 1995).Google Scholar
[25]Sims, C. C., Computation with finitely presented groups, Encyclopedia of Mathematics 48 (Cambridge University Press, Cambridge, 1994).Google Scholar
[26]Todd, J. A. and Coxeter, H. S. M., ‘A practical method for enumerating cosets of finite abstract groups’, Proc. Edinburgh Math. Soc. 5 (1936), 2634.CrossRefGoogle Scholar