WILF , and HERB , Two Maple packages that automatically find (rigorously and empirically, respectively) Enumeration Schemes for counting permutations with forbidden patterns (Wilf classes). They accompanies Doron Zeilberger’s paper ”Enumeration Schemes, and More Importantly, Their Automatic Generation”.

References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Bean, Christian; Gudmundsson, Bjarki; Ulfarsson, Henning: Automatic discovery of structural rules of permutation classes (2019)
  2. Mansour, Toufik; Shattuck, Mark; Wagner, Stephan: Counting subwords in flattened partitions of sets (2015)
  3. Baxter, Andrew M.: Refining enumeration schemes to count according to permutation statistics (2014)
  4. Daly, Daniel; Pudwell, Lara: Pattern avoidance in the rook monoid (2014)
  5. Godbole, Anant; Goyt, Adam; Herdan, Jennifer; Pudwell, Lara: Pattern avoidance in ordered set partitions (2014)
  6. Mansour, Toufik; Shattuck, Mark: Some enumerative results related to ascent sequences (2014)
  7. Baxter, Andrew M.; Pudwell, Lara K.: Enumeration schemes for vincular patterns (2012)
  8. Mansour, Toufik; Schork, Matthias; Shattuck, Mark: Catalan numbers and pattern restricted set partitions (2012)
  9. Mansour, Toufik; Shattuck, Mark: Pattern-avoiding set partitions and Catalan numbers (2011)
  10. Firro, Ghassan; Mansour, Toufik: Restricted (k)-ary words and functional equations (2009)
  11. Albert, M. H.; Elder, M.; Rechnitzer, A.; Westcott, P.; Zabrocki, M.: On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia (2006)
  12. Vatter, Vincent: Finitely labeled generating trees and restricted permutations (2006)
  13. Kremer, Darla; Shiu, Wai Chee: Finite transition matrices for permutations avoiding pairs of length four patterns (2003)
  14. Zeilberger, Doron: Enumeration schemes and, more importantly, their automatic generation (1998)