On complexity of multiplication in finite soluble groups.

DOI10.1016/J.JALGEBRA.2014.08.036MaRDI QIDQ468715zbMATH OpenOpenAlexFDO

Authors M. F. Newman, Alice C. Niemeyer

Publication date 7 November 2014

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.0150

zbMATH Keywords

finite soluble groupscollection from the leftcomplexity of multiplicationpolycyclic presentations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05)

Abstract: We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.

Recommendations

• Complexity of multiplication in some group algebras
• On the complexity of computation in finite Abelian, nilpotent and soluble groups
• On the complexity of some problems on groups input as multiplication tables
• The complexity of solving equations over finite groups
• The complexity of the equivalence problem for nonsolvable groups
• scientific article; zbMATH DE number 56705
• scientific article; zbMATH DE number 609987
• Complexity and computation in matrix groups.
• On the Solvability of Finite Groups
• scientific article; zbMATH DE number 919272

Cites work

• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• Collection from the left
• Collection from the left and other strategies
• Efficient collection in infinite polycyclic groups.
• Special polycyclic generating sequences for finite soluble groups.
• The Magma algebra system. I: The user language

Cited in

(6)

• Generation of finite groups with cyclic Sylow subgroups
• Universal covers of finite groups
• Collection from the left
• Computation of orders and cycle lengths of automorphisms of finite solvable groups
• Collection from the left and other strategies
• Isomorphism testing of groups of cube-free order

Describes a project that uses

Uses Software

• Magma
• GAP

This page was built for publication: On complexity of multiplication in finite soluble groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468715)