• SnapPea

  • Referenced in 163 articles [sw06873]
  • given a name indicating the number of ideal tetrahedra, the number of orientable ... following data are listed: volume, Chern-Simons invariant (if orientable), homology, symmetry or isometry group...
  • FourTiTwo

  • Referenced in 8 articles [sw07615]
  • algorithms for permutation invariant chains of Laurent lattice ideals This paper is an investigation ... chains of lattice ideals in polynomial rings that are invariant under a symmetric group action ... ascending chain of ideals I 1 ⊆I 2 ⊆⋯ eventually stabilizes. However, the chains in question ... authors show that invariant chains of Laurent lattice ideals stabilize up to monomial localization. Moreover...
  • Aligator

  • Referenced in 10 articles [sw00029]
  • package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation ... loop variables, computing the ideal of polynomial invariants by variable elimination, invariant filtering and completeness...
  • symmChainGens

  • Referenced in 8 articles [sw06689]
  • study chains of lattice ideals that are invariant under a symmetric group action...
  • Aligator.jl

  • Referenced in 3 articles [sw26257]
  • software package for automatically generating all polynomial invariants of the rich class of extended ... loop variables and infer the ideal of polynomial invariants by variable elimination based on Gröbner...
  • NetLSD

  • Referenced in 5 articles [sw32341]
  • efficiency of its computation. Ideally, graph comparison should be invariant to the order of nodes...
  • PhylogeneticTrees

  • Referenced in 4 articles [sw41769]
  • Macaulay2, which allows users to compute phylogenetic invariants for group-based tree models. We provide ... calculate a generating set for a phylogenetic ideal as well as a lower bound...
  • CodepthThree

  • Referenced in 4 articles [sw12131]
  • classification algorithm. Let I be an ideal of a regular local ring Q with residue ... above by computation of a few cohomological invariants...
  • SchNet

  • Referenced in 7 articles [sw40890]
  • revolutionize quantum chemistry as it is ideally suited to learn representations for structured data ... fundamental quantum-chemical principles. This includes rotationally invariant energy predictions and a smooth, differentiable potential...
  • Isca

  • Referenced in 1 article [sw36475]
  • complexity. Isca is a framework for the idealized modelling of the global circulation of planetary ... radiation options are available, from dry, time invariant, Newtonian thermal relaxation to moist dynamics with ... depths and a surface mixed layer. An idealized grey radiation scheme, a two-band scheme...
  • POSETS

  • Referenced in 1 article [sw32240]
  • subposet, distributive lattice of order ideals, etc. Once a poset has been generated, a large ... tools implemented reflects the authors’ interests: enumerative invariants, chains, multichains, antichains, rank generating functions, Mobius...
  • AXIOM

  • Referenced in 173 articles [sw00063]
  • Axiom is a general purpose Computer Algebra system...
  • BIGEBRA

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

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

  • Referenced in 115 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CLIFFORD

  • Referenced in 84 articles [sw00131]
  • CLIFFORD performs various computations in Grass mann and...
  • CoCoA

  • Referenced in 654 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Dafny

  • Referenced in 73 articles [sw00183]
  • Dafny is an imperative object-based language with...
  • FGb

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

  • Referenced in 58 articles [sw00297]
  • Fast library for number theory: an introduction. We...