activity
20112015
most citedComputational Approaches to Consecutive Pattern Avoidance in Permutations

24 citations · 32 across the 6 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

math.CO2012

Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes

Brian Nakamura, Doron Zeilberger

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"…