Refined solvable presentations for polycyclic groups.

MaRDI QIDQ4906876zbMATHFDO

Authors

Publication date 28 February 2013

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

zbMATH Keywords

finitely presented groupsalgorithmic problemspolycyclic quotient algorithmpresentations of polycyclic groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

Abstract: We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These presentations can be described effectively by presentation maps which yield the basis data structure to define a polycyclic group in computer-algebra-systems like {scshape Gap} or {scshape Magma}. We study refined solvable presentations and, in particular, we obtain consistency criteria for them. This consistency implementation demonstrates that it is often faster than the existing methods for polycyclic groups.

Recommendations

• Computing polycyclic presentations for polycyclic rational matrix groups.
• Practical algorithms for polycyclic matrix groups
• scientific article; zbMATH DE number 4208376
• The algorithmic theory of polycyclic-by-finite groups
• A practical algorithm for finding matrix representations for polycyclic groups

Cited in

(3)

• Solvable Polygroups and Derived Subpolygroups
• Left 3-Engel elements in groups of exponent 60
• Left 3-Engel elements in groups of exponent 5.

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Refined solvable presentations for polycyclic groups.

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