Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths

Details Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths

2005-03-15

arxiv.org/abs/math/0503300v1

Mathematics

Combinatorics

8 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-316479