@inbook{KauersPaule:C-finite:2011,
Abstract = {Polynomial sequences obey certain linear recurrence equations with constant coefficients, as we have seen in the previous chapter. But in general, a sequence satisfying a linear recurrence equation with constant coefficients need not be a polynomial sequence. The solutions to such recurrence equations form a strictly larger class of sequences, the so-called C-finite sequences. This is the class we consider now.},
Address = {Vienna},
Author = {Kauers, Manuel and Paule, Peter},
BookTitle = {The Concrete Tetrahedron: Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates},
ISBN = {978-3-7091-0445-3},
Pages = {63--86},
Publisher = {Springer Vienna},
Title = {C-Finite Sequences},
URL = {https://doi.org/10.1007/978-3-7091-0445-3\_4},
Year = {2011},
bdsk-url-1 = {https://doi.org/10.1007/978-3-7091-0445-3\_4},
date-added = {2020-05-14 16:37:15 +0200},
date-modified = {2020-05-14 16:37:44 +0200},
doi = {10.1007/978-3-7091-0445-3_4}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A