swMATH ID: 19254
Software Authors: Brian Nakamura; Doron Zeilberger
Description: One of the most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given a pattern, or set of patterns, and you are asked to find a “formula”, or at least an efficient algorithm, that inputs a positive integer n and outputs the number of permutations avoiding that pattern. F1234, Also to enumerate permutations containing exactly r occurrences of the pattern 1234 for r=0,1,2,3, ... but made more efficient for small r,
Homepage: http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/Gwilf.html
Dependencies: Maple
Related Software: F12345; P123456; P12345; P1234; F123; P123; OEIS; SMCper; MahonianStat; HolonomicFunctions
Cited in: 4 Publications

Citations by Year