18 citations · 63 across the 31 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011
Partially Ordinal Sums and -partitions
Daniel K. Du, Qing-Hu Hou
We present a method of computing the generating function $f_P(\x)$ of -partitions of a poset . The idea is to introduce two kinds of transformations on posets and compute $f_…
math.CO2011
Formal residue and computer proofs of combinatorial identities
Qing-Hu Hou, Hai-Tao Jin
The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometr…
math.CA2011
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…