12 citations · 12 across the 3 of their papers we have counts for
3 papers
math.CO2005★ 12 cited
On the Hook Length Formula for Binary Trees
William Y. C. Chen, Laura L. M. Yang
We present a simple combinatorial proof of Postnikov's hook length formula for binary trees.
math.CO2005
Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths
William Y. C. Chen, Louis W. Shapiro, Laura L. M. Yang
The problem of counting plane trees with 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 Sta…
math.CO2004
Weighted 2-Motzkin Paths
William Y. C. Chen, Sherry H. F. Yan, Laura L. M. Yang
This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection…