Descriptions of groups of prime-power order

Newman, M. F.; Nickel, Werner; Niemeyer, Alice C.

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.

Descriptions of groups of prime-power order

Date

1998

Authors

Newman, M. F.

Nickel, Werner

Niemeyer, Alice C.

Abstract

We describe in some detail an algorithm which is an important ingredient in the performance of programs for working with descriptions of groups of prime-power order. It is an algorithm for computing a useful power-commutator presentation for the p-covering group of a group given by a power-commutator presentation. We prove that the algorithm is correct and give some examples.

URI

https://dspace-test.anu.edu.au/handle/1885/733730296

Collections

DevOps Pure Testing

Source

Journal of Symbolic Computation

Type

Article

DOI

10.1006/jsco.1997.0193

Full item page

Cultural advice

Descriptions of groups of prime-power order

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until