On complexity of multiplication in finite soluble groups

Newman, Michael; Niemeyer, Alice

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.

On complexity of multiplication in finite soluble groups

Date

2015

Authors

Newman, Michael

Niemeyer, Alice

Publisher

Elsevier

Abstract

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble group by restricting attention to certain polycyclic presentations of the group. As a corollary we give an upper bound for the complexity of collection from the left in finite p-groups in terms of the group order.

URI

http://hdl.handle.net/1885/31964

Collections

ANU Research Publications

Source

Journal of Algebra

Type

Journal article

DOI

10.1016/j.jalgebra.2014.08.036

Full item page

Cultural advice

On complexity of multiplication in finite soluble groups

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