arXiv Analytics

Sign in

arXiv:1210.6455 [math.CO]AbstractReferencesReviewsResources

An application of a bijection of Mansour, Deng, and Du

David Callan

Published 2012-10-24Version 1

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.

Comments: 4 pages
Categories: math.CO
Subjects: 05A15
Related articles: Most relevant | Search more
arXiv:1407.8537 [math.CO] (Published 2014-07-31)
A new application of the $\otimes_h$-product to $α$-labelings
arXiv:1210.3063 [math.CO] (Published 2012-10-10)
Multivariate Fuss-Narayana polynomials and their application to random matrices
arXiv:1509.04862 [math.CO] (Published 2015-09-16)
An application of the Local C(G,T) Theorem to a conjecture of Weiss

Links

Toolbox