Discrete Mathematics & Theoretical Computer Science
| author: | M. D. Atkinson |
|---|---|
| title: | Some equinumerous pattern-avoiding classes of permutations |
| keywords: | Permutations, patterns, enumeration |
| 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,…,p}∪{m-q+1, m-q+2, …,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. 2000 MATHEMATICS SUBJECT CLASSIFICATION: 05A05 If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |
| reference: | M. D. Atkinson (2005), Some equinumerous pattern-avoiding classes of permutations, Discrete Mathematics and Theoretical Computer Science 7, pp. 71-74 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm070106.ps.gz (47 K) |
| ps-source: | dm070106.ps (110 K) |
| pdf-source: | dm070106.pdf (63 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.