Title of article
A combinatorial proof of a result of Gessel and Greene
Author/Authors
Michael La Croix، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
6
From page
2251
To page
2256
Abstract
A combinatorial proof is given of a result of Gessel and Greene relating the sizes of two classes of permutations. A natural map from one class to the other is described in terms of a shared recursive structure.
Keywords
Decorated permutation , Recursive decomposition , Bijection
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948082
Link To Document