Skip to main content Accessibility help

On defining groups efficiently without using inverses

  • C. M. CAMPBELL (a1), J. D. MITCHELL (a2) and N. RUšKUC (a3)

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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Proceedings of the Cambridge Philosophical Society
  • ISSN: 0305-0041
  • EISSN: 1469-8064
  • URL: /core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed