• Magma

  • Referenced in 1657 articles [sw00540]
  • algebra, number theory, algebraic geometry and algebraic combinatorics. It provides a mathematically rigorous environment...
  • polymake

  • Referenced in 204 articles [sw00724]
  • polymake is a tool to study the combinatorics and the geometry of convex polytopes...
  • Sage-Combinat

  • Referenced in 40 articles [sw16448]
  • toolbox for computer exploration in algebraic combinatorics. Sage-Combinat is a software project whose mission ... extensible toolbox for computer exploration in (algebraic) combinatorics, and foster code sharing between researchers...
  • SIGMA

  • Referenced in 46 articles [sw06904]
  • Carsten Schneider, a member of the RISC Combinatorics group...
  • Omega

  • Referenced in 43 articles [sw11878]
  • Axel Riese, a Postdoc of the RISC Combinatorics group. It has been developed together with...
  • MuPAD-Combinat

  • Referenced in 24 articles [sw04933]
  • MuPAD-Combinat was an open-source algebraic combinatorics package for the computer algebra system MuPAD ... extensible toolbox for computer exploration in algebraic combinatorics, and foster code sharing between researchers...
  • ACE

  • Referenced in 11 articles [sw15066]
  • Algebraic Combinatorics Environment). ACE is a Maple library which includes packages providing combinatorial tools useful ... algebraic combinatorics. Functions are mostly related to the symmetric group and handle such objects...
  • Graded Ring Database

  • Referenced in 13 articles [sw11291]
  • online resource for researchers in geometry and combinatorics that combines several major classifications in those...
  • WILF

  • Referenced in 13 articles [sw11643]
  • Wilf classes and enumeration, and even to combinatorics, the main point of this article...
  • a-tint

  • Referenced in 6 articles [sw08418]
  • study of moduli spaces, where the underlying combinatorics of the varieties involved allow a much...
  • RLangGFun

  • Referenced in 5 articles [sw14280]
  • implementation are discussed; some examples from combinatorics illustrate its applicability...
  • P123

  • Referenced in 4 articles [sw19252]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • F123

  • Referenced in 4 articles [sw19253]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • F1234

  • Referenced in 4 articles [sw19254]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • P1234

  • Referenced in 4 articles [sw19255]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • P12345

  • Referenced in 4 articles [sw19256]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • P123456

  • Referenced in 4 articles [sw19257]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • F12345

  • Referenced in 4 articles [sw19258]
  • most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given...
  • Algolib

  • Referenced in 2 articles [sw04111]
  • combstruct, gfun, and gdev. Studies in Automatic Combinatorics are extensive example sessions that serve ... illustrating their use in the study of combinatorics, special functions or asymptotic analysis. Also available...
  • combinat

  • Referenced in 2 articles [sw04521]
  • combinat: combinatorics utilities , routines for combinatorics...