• 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...
  • GBNP

  • Referenced in 18 articles [sw07724]
  • would imply solvability of the word problem for finitely presented (semi)groups...
  • 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...
  • IRREDSOL

  • Referenced in 1 article [sw08647]
  • IRREDSOL: A Library of irreducible solvable linear groups over finite fields and of finite primivite...
  • 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...
  • CoCoA

  • Referenced in 595 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • COMPAS

  • Referenced in 14 articles [sw00147]
  • In this paper we describe COMPAS -- the open...
  • GAP

  • Referenced in 2681 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • gfun

  • Referenced in 126 articles [sw00344]
  • The gfun package provides tools for determining and...
  • KANT/KASH

  • Referenced in 155 articles [sw00481]
  • KASH/KANT is a computer algebra system (CAS) for...
  • LAPACK

  • Referenced in 1579 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Macaulay2

  • Referenced in 1538 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 2673 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 4890 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 5662 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 11360 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • MOLGEN

  • Referenced in 26 articles [sw00586]
  • Due to a detailed description of the underlying...
  • PARI/GP

  • Referenced in 560 articles [sw00680]
  • PARI/GP is a widely used Computer Algebra System...