An application of a bijection of Mansour, Deng, and Du
Combinatorics
2012-10-25 v1
Abstract
The large Schroder numbers are known to count several classes of permutations avoiding two 4-letter patterns. Here we show they count another family of permutations, those whose left to right minima decomposition, when reversed, is 321-avoiding. The main tool is the Mansour-Deng-Du bijection from 321-avoiding permutations to Dyck paths.
Keywords
Cite
@article{arxiv.1210.6455,
title = {An application of a bijection of Mansour, Deng, and Du},
author = {David Callan},
journal= {arXiv preprint arXiv:1210.6455},
year = {2012}
}
Comments
4 pages