• KELLEY

  • Referenced in 490 articles [sw04829]
  • author and his group. Implicit filtering methods use finite difference approximations of the gradient, which...
  • Cayley

  • Referenced in 109 articles [sw01053]
  • order; a test for simplicity of finite groups; calculation of transfer; calculation of a presentation...
  • GRAPE

  • Referenced in 65 articles [sw07516]
  • constructing and analysing graphs related to groups, finite geometries, and designs. The vast majority ... language, except for the automorphism group and isomorphism testing functions, which use Brendan McKay...
  • OTTER

  • Referenced in 204 articles [sw02904]
  • areas of finite semigroups, ternary Boolean algebra, logic calculi, combinatory logic, group theory, lattice theory...
  • CAS

  • Referenced in 19 articles [sw07634]
  • handling of characters of finite groups CAS is a system for handling characters of finite...
  • HAP

  • Referenced in 25 articles [sw04870]
  • computations related to the cohomology of groups. Both finite and infinite groups are handled, with...
  • QUOTPIC

  • Referenced in 15 articles [sw04937]
  • plotting the finite quotients of a finitely presented group. It builds the quotients via descending ... system for displaying finite quotients of finitely presented groups’, Proc. DIMACS Workshop on Groups...
  • coxeter

  • Referenced in 13 articles [sw07772]
  • working with root systems and finite Coxeter groups. It provides facilities for manipulating roots, reflections ... permutation representations and irreducible characters of finite Coxeter groups, and for retrieving information such...
  • BRAID

  • Referenced in 11 articles [sw04311]
  • applications Let G be a finite group. By Riemann’s existence theorem, braid orbits...
  • kbmag

  • Referenced in 12 articles [sw04845]
  • Knuth-Bendix completion program on finite semigroup, monoid or group presentations ... attempting to compute automatic structures of finitely presented groups...
  • LAGUNA

  • Referenced in 14 articles [sw08650]
  • modular group algebra of the finite p-group and for investigation of Lie algebra associated...
  • NQ

  • Referenced in 7 articles [sw10503]
  • computation of nilpotent factor groups of finitely presented groups. It requires the presence ... lower central series of a finitely presented group. Computation of nilpotent groups satisfying a given...
  • Mod-p group cohomology

  • Referenced in 7 articles [sw08638]
  • computes modular cohomology rings of finite groups. It yields minimal presentations of the cohomology rings ... cohomology rings of all groups of order 128. It was also used to compute ... cohomology of various finite simple groups (for different primes p), including the first computation...
  • PyCox

  • Referenced in 7 articles [sw09237]
  • PyCox: computing with (finite) Coxeter groups and Iwahori-Hecke algebras. We introduce the computer algebra ... older CHEVIE system, for working with Coxeter groups and Hecke algebras. This includes ... graphs, which works efficiently for all finite groups of rank ⩽8 (except...
  • HadamardSearch

  • Referenced in 8 articles [sw18675]
  • cocyclic Hadamard matrices over a finite group G for which a homological model...
  • REPSN

  • Referenced in 7 articles [sw00800]
  • matrix representations. Let G be a finite group and χ a faithful irreducible character...
  • INVAR

  • Referenced in 6 articles [sw10662]
  • Maple package for invariant theory of finite groups...
  • symmetry

  • Referenced in 3 articles [sw14839]
  • equivariant vector field are considered. Both finite groups and continuous groups are supported. The topics ... module of equivariants; fundamental invariants for finite groups by Sturmfels algorithm; fundamental equivariants for finite ... space reduction; build-in knowledge of finite groups and compact Lie groups; algebraic groups; Derksen...
  • NQL

  • Referenced in 6 articles [sw08257]
  • objects to work with finitely L-presented groups. The main part of the package ... nilpotent quotient algorithm for finitely L-presented groups. This is an algorithm which takes ... input a finitely L-presented group G and a positive integer c. It computes...