arXiv:math/9909019 [math.CO]AbstractReferencesReviewsResources
Permutations avoiding a set of patterns from S_3 and a pattern from S_4
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
Keywords: permutations avoiding, nonempty set
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
Permutations avoiding 1324 and patterns in Ćukasiewicz paths
The Enumeration of Permutations Avoiding 3124 and 4312