Flexible Schemes for Pattern-Avoiding Permutations
classification
🧮 math.CO
keywords
classespattern-avoidingpermutationsschemesefficientlyencodingenumerateenumeration
read the original abstract
We modify 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.