Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959031
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:07:57 PM
Last modification on : Sunday, October 13, 2019 - 7:28:14 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:16:26 PM

File

dm070106.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00959031, version 1

Collections

Citation

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

Share

Metrics

Record views

146

Files downloads

700