• nishe

  • Referenced in 1 article [sw19166]
  • partial knowledge of the full automorphism group. The proposed modifications are not specific to Miyazaki ... graphs. Any graph with a nontrivial automorphism group can benefit from our approach...
  • AutHyp

  • Referenced in 1 article [sw22773]
  • Automorphism groups of hyperbolic lattices. Based on the concept of dual cones introduced ... compute a generating system of the group of automorphisms of an integral lattice endowed with ... method to determine generating systems of discontinuous groups acting on dual cones. The application...
  • AutParCommGrp

  • Referenced in 1 article [sw35048]
  • AutParCommGrp package (Finite Presentations of Automorphism Groups of Partially Commutative Groups and Their Subgroups...
  • GraphCanon

  • Referenced in 1 article [sw30190]
  • canonicalization, graph isomorphism, and computation of automorphism groups of graphs. The package additionally contains...
  • Codes over Z4

  • Referenced in 1 article [sw32325]
  • also functions to compute the permutation automorphism group for Hadamard and extended perfect codes over...
  • CAS

  • Referenced in 22 articles [sw07634]
  • system for handling characters of finite groups, including irrationalities, and partially defined characters. The commands ... Galois conjugate; using an outer automorphism; powering, tensoring, inducing, extending; extracting irreducible components (using several ... structure constants of the centre of the group algebra; kernel of a character; p-blocks...
  • SymPol

  • Referenced in 6 articles [sw09846]
  • helps to compute restricted automorphisms (parts of the linear symmetry group) of polyhedra and performs...
  • Ferret

  • Referenced in 2 articles [sw27107]
  • particular properties. This include graph automorphisms, stabilizers and group intersection. Canonical Images. This involves finding...
  • BlissInterface

  • Referenced in 0 articles [sw31136]
  • software bliss: A Tool for Computing Automorphism Groups and Canonical Labelings of Graphs, written...
  • PermLib

  • Referenced in 7 articles [sw09845]
  • strong generating sets (BSGS). Additionally, it computes automorphisms of symmetric matrices and find the lexicographically ... features a very basic recognition of permutation group types. You may download the complete PermLib...
  • CRISP

  • Referenced in 1 article [sw27976]
  • algorithm which can decide membership in the group class. Moreover, CRISP contains algorithms ... prescribed set of automorphisms and belonging to a given group class. This includes an improved...
  • ATENSOR

  • Referenced in 12 articles [sw00055]
  • ATENSOR - REDUCE program for tensor simplification. Nature of...
  • ACL2

  • Referenced in 291 articles [sw00060]
  • ACL2 is both a programming language in which...
  • BIGEBRA

  • Referenced in 21 articles [sw00078]
  • Clifford and Graßmann Hopf algebras via the BIGEBRA...
  • CASA

  • Referenced in 111 articles [sw00108]
  • CASA is a special-purpose system for computational...
  • CLIFFORD

  • Referenced in 85 articles [sw00131]
  • CLIFFORD performs various computations in Grass mann and...
  • GAP

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

  • Referenced in 289 articles [sw00363]
  • GMP is a free library for arbitrary precision...
  • HURRY

  • Referenced in 27 articles [sw00420]
  • HURRY: An acceleration algorithm for scalar sequences and...
  • KANT/KASH

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