Refined solvable presentations for polycyclic groups

Details Refined solvable presentations for polycyclic groups Refined solvable presentations for polycyclic groups

2011-02-08

arxiv.org/abs/1102.1650v2

Mathematics

Group Theory

Preprint

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Refined solvable presentations for polycyclic groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Refined solvable presentations for polycyclic groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refined solvable presentations for polycyclic groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-502783