# Constant term evaluation for summation of C-finite sequences

Abstract : Based on constant term evaluation, we present a new method to compute a closed form of the summation $∑_k=0^n-1 ∏_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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.inria.fr/hal-01186231
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 24, 2015 - 3:43:42 PM
Last modification on : Friday, April 12, 2019 - 2:26:48 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 4:19:42 PM

### File

dmAN0155.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01186231, version 1

### Citation

Qing-Hu Hou, Guoce Xin. Constant term evaluation for summation of C-finite sequences. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.761-772. ⟨hal-01186231⟩

Record views