On complexity of multiplication in finite soluble groups

Mike Newman; Alice Niemeyer

doi:10.1016/j.jalgebra.2014.08.036

On complexity of multiplication in finite soluble groups

Mike Newman
, Alice Niemeyer

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	425-430
Journal	Journal of Algebra
Volume	421
DOIs	https://doi.org/10.1016/j.jalgebra.2014.08.036
Publication status	Published - 2015

Access to Document

10.1016/j.jalgebra.2014.08.036

Cite this

@article{3a8fb7652ce24f4c8a68e72662cdaf75,

title = "On complexity of multiplication in finite soluble groups",

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.",

author = "Mike Newman and Alice Niemeyer",

year = "2015",

doi = "10.1016/j.jalgebra.2014.08.036",

language = "English",

volume = "421",

pages = "425--430",

journal = "Journal of Algebra",

publisher = "Elsevier",

}

TY - JOUR

T1 - On complexity of multiplication in finite soluble groups

AU - Newman, Mike

AU - Niemeyer, Alice

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

U2 - 10.1016/j.jalgebra.2014.08.036

DO - 10.1016/j.jalgebra.2014.08.036

M3 - Article

VL - 421

SP - 425

EP - 430

JO - Journal of Algebra

JF - Journal of Algebra

ER -

On complexity of multiplication in finite soluble groups

Abstract

Access to Document

Fingerprint

Cite this