Pattern Count on Multiply Restricted Permutations

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.