Parity reversing involutions on plane trees and 2-Motzkin paths

From MaRDI portal
Publication:819014

DOI10.1016/J.EJC.2004.07.013zbMATH Open1082.05005arXivmath/0503300OpenAlexW2022051109MaRDI QIDQ819014FDOQ819014


Authors: William Y. C. Chen, Louis W. Shapiro, Laura L. M. Yang Edit this on Wikidata


Publication date: 22 March 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: The problem of counting plane trees with n edges and an even or an odd number of leaves was studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and Simion in their study of Schr"oder paths, and it was recently derived by Coker using the Lagrange inversion formula. An equivalent problem for partitions was independently studied by Klazar. We present three parity reversing involutions, one for unlabelled plane trees, the other for labelled plane trees and one for 2-Motzkin paths which are in one-to-one correspondence with Dyck paths.


Full work available at URL: https://arxiv.org/abs/math/0503300




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Parity reversing involutions on plane trees and 2-Motzkin paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819014)