The butterfly decomposition of plane trees

• Published in: Discrete Applied Mathematics Vol. 155; no. 17; pp. 2187 - 2201
• Main Authors: Chen, William Y.C., Li, Nelson Y., Shapiro, Louis W.
• Format: Journal Article
• Language: English
• Published: Lausanne Elsevier B.V 15.10.2007; Amsterdam Elsevier; New York, NY
• Subjects: [formula omitted]-Colored plane tree; Algebra; Algorithmics. Computability. Computer arithmetics; Applied sciences; Butterfly decomposition; Chain; Combinatorics; Combinatorics. Ordered structures; Computer science; control theory; systems; Doubly rooted plane tree; Dyck path; Exact sciences and technology; Functional analysis; Graph theory; Mathematical analysis; Mathematics; Number theory; Plane tree; Schröder path; Sciences and techniques of general use; Theoretical computing; Chain; Plane tree; Schröder path; 05A19; k -Colored plane tree; Butterfly decomposition; Dyck path; 05A15; 05C05; Doubly rooted plane tree; Generating function; Computer theory; Plane; Color; Decomposition method; Average; Optimization; Combinatorial identity; 05A15;05A19;05C05; Catalan number; Tree; Combinatorics; Plane tree; Doubly rooted plane tree; k-Colored plane tree; Chain; Butterfly decomposition; Dyck path; Schroder path; Application; Parity
• DOI: 10.1016/j.dam.2007.04.020
• ISSN: 0166-218X

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition, which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial coefficients. We also establish a one-to-one correspondence between leaf-colored doubly rooted plane trees and free Schröder paths. The classical Chung–Feller theorem as well as some generalizations and variations follow quickly from the butterfly decomposition. We next obtain two involutions on free Dyck paths and free Schröder paths, leading to parity results and combinatorial identities. We also use the butterfly decomposition to give a combinatorial treatment of Klazar's generating function for the number of chains in plane trees. Finally we study the total size of chains in plane trees with n edges and show that the average size of such chains tends asymptotically to ( n + 9 ) / 6 .