• # GroupExt

• Referenced in 3 articles [sw11538]
• construction of finite solvable groups revisited. We describe a new approach towards the systematic construction ... practical algorithm for the construction of finite solvable groups up to isomorphism. We report ... implementation of this method for finite solvable groups and exhibit some sample applications...
• # Polenta

• Referenced in 5 articles [sw08602]
• compute polycyclic presentations of matrix groups (finite or infinite). As a by-product, this package ... certain module series for modules of solvable groups. For example, if G is a rational...
• # PCQL

• Referenced in 2 articles [sw09148]
• polycyclic quotients of groups defined by a so-called finite $L$-presentation. This type ... presentation incorporates all finite presentations as well as certain infinite presentations. The algorithm allows ... solvable quotients of a given derived length. The algorithm uses Groebner bases over integral group...
• # matgrp

• Referenced in 1 article [sw22602]
• will work for matrix groups over finite fields, as well as over residue class rings ... apply to matrix groups. However if calling FittingFreeLiftSetup on a matrix group first, afterwards certain ... ConjugacyClasses and MaximalSubgroupClassReps) will apply with Solvable radical methods...
• # GrpConst

• Referenced in 1 article [sw26617]
• finite groups. The GrpConst package contains methods to construct up to isomorphism the groups ... given order. The FrattiniExtensionMethod constructs all soluble groups of a given order. On request ... groups of order p^n. The UpwardsExtensions algorithm takes as input a permutation group ... permutation groups, one for each extension of G by a soluble group of order...