Flexible Schemes for Pattern-Avoiding Permutations
Combinatorics
2019-05-28 v2
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.
Cite
@article{arxiv.1905.07283,
title = {Flexible Schemes for Pattern-Avoiding Permutations},
author = {Yonah Biers-Ariel},
journal= {arXiv preprint arXiv:1905.07283},
year = {2019}
}