Bijections for refined restricted permutations
Combinatorics
2007-05-23 v1
Abstract
We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and the first author. We also show that our bijection preserves additional statistics, which extends the previous results.
Cite
@article{arxiv.math/0212328,
title = {Bijections for refined restricted permutations},
author = {Sergi Elizalde and Igor Pak},
journal= {arXiv preprint arXiv:math/0212328},
year = {2007}
}
Comments
9 pages, 4 figures