arXiv Analytics

Sign in

arXiv:math/9909019 [math.CO]AbstractReferencesReviewsResources

Permutations avoiding a set of patterns from S_3 and a pattern from S_4

T. Mansour

Published 1999-09-02Version 1

In this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1910.13809 [math.CO] (Published 2019-10-30)
Crossings over permutations avoiding some pairs of three length-patterns
arXiv:1406.2890 [math.CO] (Published 2014-06-11, updated 2015-01-08)
Permutations avoiding 1324 and patterns in Ɓukasiewicz paths
arXiv:1309.0832 [math.CO] (Published 2013-09-03, updated 2015-02-11)
The Enumeration of Permutations Avoiding 3124 and 4312