Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T04:25:59.144Z Has data issue: false hasContentIssue false

On defining groups efficiently without using inverses

Published online by Cambridge University Press:  02 August 2002

C. M. CAMPBELL
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews KY16 9SS. e-mail: cmc@st-and.ac.uk
J. D. MITCHELL
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews KY16 9SS. e-mail: jamesm@mcs.st-and.ac.uk
N. RUšKUC
Affiliation:
Mathematical Institute, University of St Andrews, St Andrews KY16 9SS. e-mail: nik@mcs.st-and.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

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.

Let G be a group, and let 〈A[mid ]R〉 be a finite group presentation for G with [mid ]R[mid ][ges ][mid ]A[mid ]. Then there exists a finite semigroup presentation 〈B[mid ]Q〉 for G such that [mid ]Q[mid ]-[mid ]B[mid ] = [mid ]R[mid ]-[mid ]A[mid ]. Moreover, B is either the same generating set or else it contains one additional generator.

Information

Type
Research Article
Copyright
2002 Cambridge Philosophical Society