Some equinumerous pattern-avoiding classes of permutations
Suppose that p,q,r,s are non-negative integers with m=p+q+r+s. The class X(p,q,r,s) of permutations that contain no pattern of the form α β γ where |α |=r, |γ |=s and β is any arrangement of \1,2,\ldots,p\∪ \m-q+1, m-q+2, \ldots,m\ is considered. A recurrence relation to enumerate the permutations o...
Main Author: | M. D. Atkinson |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/356/pdf |
Similar Items
-
A relation on 132-avoiding permutation patterns
by: Natalie Aisbett
Published: (2015-12-01) -
Permutations Containing and Avoiding $\textit{123}$ and $\textit{132}$ Patterns
by: Aaron Robertson
Published: (1999-01-01) -
Avoiding patterns in irreducible permutations
by: Jean-Luc Baril
Published: (2016-01-01) -
Self-complementing permutations of k-uniform hypergraphs
by: Artur Szymański, et al.
Published: (2009-01-01) -
String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01)