Abstract
We study V- and ^-patterns which generalize valleys and peaks, as well as increasing and decreasing runs, in permutations. A complete classi¯cation of permutations (multi)-avoiding V- and ¤-patterns of length 4 is given. We also establish a connection between restricted permutations and matchings in the coronas of complete graphs.
Original language | English |
---|---|
Pages (from-to) | 203-215 |
Number of pages | 13 |
Journal | Ars Combinatoria |
Volume | 97 |
Publication status | Published - Oct 2010 |
Keywords
- pattern avoidance
- pattern avoiding permutation
- valleys
- peaks
- partially ordered patterns
- corona of a complete graph