The purpose of this paper is to study difference equations of the form \N\[\NP(n)a_{n+m}=Q(n)a_ n,\N\]\Nwhere \(P\) and \(Q\) are polynomials. The solutions for \(m>1\) are called \(m\)-fold hypergeometric. The main theorem states that the solutions form a subring of the ring of holonomic sequences. In several examples, sequences defined by trigonometric functions with linear arguments in the index and \(\pi\) are studied with the help of computer programs.
Recommendations
Cites work
- m-fold hypergeometric solutions of linear recurrence equations revisited
- m-sparse solution of linear ordinary differential equations with polynomial coefficients
- A fast algorithm for proving terminating hypergeometric identities
- A holonomic systems approach to special functions identities
- A non-holonomic systems approach to special function identities
- A Note on Pure Recurrence Relations
- Algorithms for m-fold hypergeometric summation
- An extension of Zeilberger's fast algorithm to general holonomic functions
- Computing hypergeometric solutions of linear recurrence equations
- Creative telescoping for holonomic functions
- D-Finite Functions
- Decision problems for linear recurrence sequences
- Decision procedure for indefinite hypergeometric summation
- Finite singularities and hypergeometric solutions of linear recurrence equations
- FPS in action
- GFUN
- Greatest factorial factorization and symbolic summation
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 1263296 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1504598 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- Hypergeometric summation. An algorithmic approach to summation and special function identities
- Minimal decomposition of indefinite hypergeometric sums
- Operations for D-algebraic functions
- Ore polynomials in Sage
- Positivity certificates for linear recurrences
- Positivity problems for low-order linear recurrence sequences
- Power series in computer algebra
- Reduction-based creative telescoping for Fuchsian D-finite functions
- Symbolic conversion of holonomic functions to hypergeometric type power series
- Termination conditions for positivity proving procedures
- Towards computerized proofs of identities
- When can we detect that a P-finite sequence is positive?
Cited in
(2)
This page was built for publication: Hypergeometric-type sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543086)
