@inbook{Petkovsek2013,
    Abstract = {Summation is closely related to solving linear recurrence equations, since an indefinite sum satisfies a first-order linear recurrence with constant coefficients, and a definite proper-hypergeometric sum satisfies a linear recurrence with polynomial coefficients. Conversely, d'Alembertian solutions of linear recurrences can be expressed as nested indefinite sums with hypergeometric summands. We sketch the simplest algorithms for finding polynomial, rational, hypergeometric, d'Alembertian, and Liouvillian solutions of linear recurrences with polynomial coefficients, and refer to the relevant literature for state-of-the-art algorithms for these tasks. We outline an algorithm for finding the minimal annihilator of a given P-recursive sequence, prove the salient closure properties of d'Alembertian sequences, and present an alternative proof of a recent result of Reutenauer's that Liouvillian sequences are precisely the interlacings of d'Alembertian ones.},
    Address = {Vienna},
    Author = {Petkov{\v{s}}ek, Marko and Zakraj{\v{s}}ek, Helena},
    BookTitle = {Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions},
    Editor = {Schneider, Carsten and Bl{\"u}mlein, Johannes},
    File = {Solving Linear Recurrence Equations With Polynomial Coefficients - PetZakPreprint - a - f.pdf},
    ISBN = {978-3-7091-1616-6},
    Pages = {259--284},
    Publisher = {Springer Vienna},
    Title = {Solving Linear Recurrence Equations with Polynomial Coefficients},
    URL = {https://doi.org/10.1007/978-3-7091-1616-6\_11},
    Year = {2013},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-7091-1616-6\_11},
    date-added = {2020-04-14 08:01:58 +0200},
    date-modified = {2020-04-14 08:01:58 +0200},
    doi = {10.1007/978-3-7091-1616-6_11}
}

@inbook{Petkovsek2013, Abstract = {Summation is closely related to solving linear recurrence equations, since an indefinite sum satisfies a first-order linear recurrence with constant coefficients, and a definite proper-hypergeometric sum satisfies a linear recurrence with polynomial coefficients. Conversely, d'Alembertian solutions of linear recurrences can be expressed as nested indefinite sums with hypergeometric summands. We sketch the simplest algorithms for finding polynomial, rational, hypergeometric, d'Alembertian, and Liouvillian solutions of linear recurrences with polynomial coefficients, and refer to the relevant literature for state-of-the-art algorithms for these tasks. We outline an algorithm for finding the minimal annihilator of a given P-recursive sequence, prove the salient closure properties of d'Alembertian sequences, and present an alternative proof of a recent result of Reutenauer's that Liouvillian sequences are precisely the interlacings of d'Alembertian ones.}, Address = {Vienna}, Author = {Petkov{\v{s}}ek, Marko and Zakraj{\v{s}}ek, Helena}, BookTitle = {Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions}, Editor = {Schneider, Carsten and Bl{\"u}mlein, Johannes}, File = {Solving Linear Recurrence Equations With Polynomial Coefficients - PetZakPreprint - a - f.pdf}, ISBN = {978-3-7091-1616-6}, Pages = {259--284}, Publisher = {Springer Vienna}, Title = {Solving Linear Recurrence Equations with Polynomial Coefficients}, URL = {https://doi.org/10.1007/978-3-7091-1616-6_11}, Year = {2013}, bdsk-url-1 = {https://doi.org/10.1007/978-3-7091-1616-6_11}, date-added = {2020-04-14 08:01:58 +0200}, date-modified = {2020-04-14 08:01:58 +0200}, doi = {10.1007/978-3-7091-1616-6_11} }