Calculating presentations for certain kinds of quotient groups

Newman, M. F.

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Calculating presentations for certain kinds of quotient groups

Date

1976-08-10

Authors

Newman, M. F.

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.