Some equinumerous pattern-avoiding classes of permutations - Archive ouverte HAL
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2005

Some equinumerous pattern-avoiding classes of permutations

Abstract

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 of X(p,q,r,s) is established. The method of proof also shows that X(p,q,r,s)=X(p,q,1,0)X(1,0,r,s) in the sense of permutational composition.\par 2000 MATHEMATICS SUBJECT CLASSIFICATION: 05A05
Fichier principal
Vignette du fichier
dm070106.pdf (44.4 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00959031 , version 1 (13-03-2014)

Identifiers

Cite

M. D. Atkinson. Some equinumerous pattern-avoiding classes of permutations. Discrete Mathematics and Theoretical Computer Science, 2005, Vol. 7, pp.71-74. ⟨10.46298/dmtcs.356⟩. ⟨hal-00959031⟩

Collections

TDS-MACS
64 View
749 Download

Altmetric

Share

More