Old and young leaves on plane trees

Details Old and young leaves on plane trees Old and young leaves on plane trees

2004-10-06

arxiv.org/abs/math/0410127v1

Mathematics

Combinatorics

11 pages, 7 figures

Scientific paper

A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees with a given number of old leaves and young leaves. The formula is obtained combinatorially by presenting two bijections between plane trees and 2-Motzkin paths which map young leaves to red horizontal steps, and old leaves to up steps plus one. We derive some implications to the enumeration of restricted permutations with respect to certain statistics such as pairs of consecutive deficiencies, double descents, and ascending runs. Finally, our main bijection is applied to obtain refinements of two identities of Coker, involving refined Narayana numbers and the Catalan numbers.

Affiliated with

Also associated with

No associations

Rating

Old and young leaves on plane trees 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 Old and young leaves on plane trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Old and young leaves on plane trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-171048