• Nilmat

  • Referenced in 20 articles [sw08583]
  • package Nilmat: Computing with nilpotent matrix groups. The Nilmat package contains methods for checking whether ... nilpotent, methods for computing with such nilpotent matrix groups and methods for contructing important classes ... such nilpotent matrix groups...
  • NQ

  • Referenced in 8 articles [sw10503]
  • Quotient Program for the computation of nilpotent factor groups of finitely presented groups. It requires ... finitely presented group. Computation of nilpotent groups satisfying a given finite set of laws. Computer...
  • NQL

  • Referenced in 8 articles [sw08257]
  • package is a nilpotent quotient algorithm for finitely L-presented groups. This is an algorithm...
  • AClib

  • Referenced in 11 articles [sw09512]
  • groups. A group is called almost crystallographic if it is finitely generated nilpotent-by-finite ... finite normal subgroups. Further, an almost crystallographic group is called almost Bieberbach...
  • finn

  • Referenced in 3 articles [sw13747]
  • Irreducibility testing of finite nilpotent linear groups. The irreducibility test is available as a Magma...
  • Sophus

  • Referenced in 10 articles [sw27981]
  • Sophusis a GAP4 package to compute with nilpotent Lie algebras over finite prime fields ... group of such Lie algebras.Sophusalso enables its user to test isomorphism between two nilpotent...
  • DeepThought

  • Referenced in 1 article [sw26968]
  • functions for computations in finitely generated nilpotent groups based on the Deep Thought algorithm...
  • ModIsom

  • Referenced in 2 articles [sw08645]
  • finite p-groups. The ModIsom package contains various methods for computing with nilpotent associative algebras ... algebras of finite p-groups, and it contains a nilpotent quotient algorithm for finitely presented...
  • LPRES

  • Referenced in 1 article [sw27983]
  • package lpres: Nilpotent Quotients of L-Presented Groups. The LPRES Package defines new GAP objects ... work with L-presented groups, namely groups given by a finite generating ... implements nilpotent quotient, Todd-Coxeter and Reidemeister-Schreier algorithms for L-presented groups...
  • GrpConst

  • Referenced in 2 articles [sw26617]
  • given order. The FrattiniExtensionMethod constructs all soluble groups of a given order. On request ... only those that are (or are not) nilpotent or supersolvable or that ... primes. The CyclicSplitExtensionMethod constructs all groups having a normal Sylow subgroup for orders...
  • PCQL

  • Referenced in 2 articles [sw09148]
  • consistent polycyclic presentations for polycyclic quotients of groups defined by a so-called finite ... variety of polycyclic quotients ranging from maximal nilpotent quotients of a given class ... algorithm uses Groebner bases over integral group rings of polycyclic groups as main means...
  • ncHilb

  • Referenced in 2 articles [sw27177]
  • algebras is obtained in terms of the nilpotency of a key matrix involved ... under the action of the general linear group. In fact, in this case such series...
  • ADOL-C

  • Referenced in 242 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • CoCoA

  • Referenced in 634 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • FGb

  • Referenced in 244 articles [sw00286]
  • FGb/Gb libraryGb is a program (191 420 lines...
  • GAP

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

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

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

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

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