The Eulerian numbers on restricted centrosymmetric permutations
Combinatorics
2009-10-14 v1
Abstract
We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, and even, is a bijection that associates a Dyck prefix of length to every centrosymmetric permutation in that avoids 123.
Cite
@article{arxiv.0910.2376,
title = {The Eulerian numbers on restricted centrosymmetric permutations},
author = {Marilena Barnabei and Flavio Bonetti and Matteo Silimbani},
journal= {arXiv preprint arXiv:0910.2376},
year = {2009}
}
Comments
17 pages, 6 figures