6 research outputs found
Permutations Restricted by Two Distinct Patterns of Length Three
Define to be the number of permutations on letters which avoid
all patterns in the set and contain each pattern in the multiset
exactly once. In this paper we enumerate and
for all . The
results for follow from two papers by Mansour and
Vainshtein.Comment: 15 pages, some relevant reference brought to my attention (see
section 4