QingHu Hou ; Guoce Xin

Constant term evaluation for summation of Cfinite sequences
dmtcs:2806 
Discrete Mathematics & Theoretical Computer Science,
January 1, 2010,
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)

https://doi.org/10.46298/dmtcs.2806
Constant term evaluation for summation of Cfinite sequencesArticle
Authors: QingHu Hou ^{1}; Guoce Xin ^{2}
NULL##NULL
QingHu Hou;Guoce Xin
1 Center for Combinatorics [Nankai]
2 Department of Mathematics
Based on constant term evaluation, we present a new method to compute a closed form of the summation $∑_k=0^n1 ∏_j=1^r F_j(a_jn+b_jk+c_j)$, where ${F_j(k)} are $C$finite sequences and $a_j$ and $a_j+b_j$ are nonnegative integers. Our algorithm is much faster than that of Greene and Wilf.