Refined solvable presentations for polycyclic groups.

zbMATH Open1269.20025arXiv1102.1650MaRDI QIDQ4906876FDOQ4906876

Authors:

Publication date: 28 February 2013

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.

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

Recommendations

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

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)

Cited In (3)

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

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)