Calculating presentations for certain kinds of quotient groups

  • Authors:
  • M. F. Newman

  • Affiliations:
  • -

  • Venue:
  • SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
  • Year:
  • 1976
  • Collection

    SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

  • Cited References

    Computer algebra handbook

Quantified Score

Hi-index 0.00

Visualization

Abstract

Over the last few years a new algorithm has emerged for manipulation with finite presentations of groups. It enables one to calculate from a given finite presentation a useful presentation for certain nilpotent quotient groups of the group presented by the input. The algorithm has been machine implemented. With the aid of these machine implementations it has been possible to dig more deeply into the structure of some groups, in particular finite groups of prime-power order, and the prospects for further investigations seem bright.