Abstract
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.
| Original language | English |
|---|---|
| Pages (from-to) | R60 |
| Number of pages | 18 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 12 |
| Issue number | 1 |
| Publication status | Published - 15 Nov 2005 |
Keywords
- stricted permutations
- pattern avoidance
- subpermutations
- RESTRICTED PERMUTATIONS
- CLOSED-SETS
Fingerprint
Dive into the research topics of 'Pattern avoidance classes and subpermutations'. Together they form a unique fingerprint.Projects
- 1 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. (PI), Gent, I. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver