Equidistribution and Sign-Balance on 321-Avoiding Permutations
| dc.creator | Adin, Ron M. | |
| dc.creator | Roichman, Yuval | |
| dc.date | 2003-04-27 | |
| dc.date | 2004-01-12 | |
| dc.date.accessioned | 2026-07-07T04:57:27Z | |
| dc.date.available | 2026-07-07T04:57:27Z | |
| dc.description | Let $T_n$ be the set of 321-avoiding permutations of order $n$. Two properties of $T_n$ are proved: (1) The {\em last descent} and {\em last index minus one} statistics are equidistributed over $T_n$, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for $T_{2n}$ and $T_{2n+1}$ are essentially equal to the last-descent enumerator for $T_n$. The proofs use a recursion formula for an appropriate multivariate generating function. | |
| dc.description | 17 pages; to appear in Sém. Lothar. Combin | |
| dc.identifier | https://arxiv.org/abs/math/0304429 | |
| dc.identifier | http://arxiv.org/abs/math/0304429 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67267 | |
| dc.subject | Combinatorics | |
| dc.title | Equidistribution and Sign-Balance on 321-Avoiding Permutations | |
| dc.type | text |