18 citations · 71 across the 58 of their papers we have counts for
5 papers · 1 filter
Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions
William Y. C. Chen, Daniel K. Du, Charles B. Mei
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of…
Oscillating Rim Hook Tableaux and Colored Matchings
William Y. C. Chen, Peter L. Guo
Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux…
The Abel-Zeilberger Algorithm
William Y. C. Chen, Qing-Hu Hou, Hai-Tao Jin
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case…
On Han's Hook Length Formulas for Trees
William Y. C. Chen, Oliver X. Q. Gao, Peter L. Guo
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has fo…
Equivalence Classes of Full-Dimensional 0/1-Polytopes with Many Vertices
William Y. C. Chen, Peter L. Guo
Let denote the -dimensional hypercube with the vertex set $V_n=\{0,1}^n$. A 0/1-polytope of is a convex hull of a subset of . This paper is concerned with the e…