Pattern Count on Multiply Restricted Permutations

arXiv1302.4063MaRDI QIDQ6239682FDOQ6239682

Publication date: 17 February 2013

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.

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

This page was built for publication: Pattern Count on Multiply Restricted Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239682)