Pattern Count on Multiply Restricted Permutations
Combinatorics
2013-02-19 v1
Abstract
Previous work has studied the pattern count on singly restricted permutations. In this work, we focus on patterns of length 3 in multiply restricted permutations, especially for double and triple pattern-avoiding permutations. We derive explicit formulae or generating functions for various occurrences of length 3 patterns on multiply restricted permutations, as well as some combinatorial interpretations for non-trivial pattern relationships.
Cite
@article{arxiv.1302.4063,
title = {Pattern Count on Multiply Restricted Permutations},
author = {Alina F. Y. Zhao},
journal= {arXiv preprint arXiv:1302.4063},
year = {2013}
}
Comments
23 pages, 2 figures