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...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Author:	M. D. Atkinson
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2005-01-01
Subjects:	enumeration permutations patterns [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/356/pdf