On the diagram of 132-avoiding permutations
| dc.creator | Reifegerste, Astrid | |
| dc.date | 2002-08-01 | |
| dc.date | 2002-10-15 | |
| dc.date.accessioned | 2026-07-07T04:49:59Z | |
| dc.date.available | 2026-07-07T04:49:59Z | |
| dc.description | The diagram of a 132-avoiding permutation can easily be characterized: it is simply the diagram of a partition. Based on this fact, we present a new bijection between 132-avoiding and 321-avoiding permutations. We will show that this bijection translates the correspondences between these permutations and Dyck paths given by Krattenthaler and by Billey-Jockusch-Stanley, respectively, to each other. Moreover, the diagram approach yields simple proofs for some enumerative results concerning forbidden patterns in 132-avoiding permutations. | |
| dc.description | 20 pages; additional reference is added | |
| dc.identifier | https://arxiv.org/abs/math/0208006 | |
| dc.identifier | http://arxiv.org/abs/math/0208006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64639 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05; 05A15 | |
| dc.title | On the diagram of 132-avoiding permutations | |
| dc.type | text |