Yonah Biers-Ariel, Rutgers University

Abstract

We present an extension of the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.