An algorithm for finding recurrence relations of binomial sums and its complexity
From MaRDI portal
Publication:1918484
DOI10.1006/JSCO.1995.1069zbMATH Open0849.68056OpenAlexW1964293744MaRDI QIDQ1918484FDOQ1918484
Authors: Nobuki Takayama 
Publication date: 4 November 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1069
Recommendations
- scientific article; zbMATH DE number 5353875
- A method to find the recurrence of sums of powers of binomial coefficient
- scientific article; zbMATH DE number 2213550
- An efficient algorithm for deriving summation identities from mutual recurrences
- Algorithm for constructing an analogue of the Binet formula
- Recurrences for sums of powers of binomial coefficients
- On recurrences for sums of powers of binomial coefficients
- Recurrences for alternating sums of powers of binomial coefficients
- Publication:3472110
- Recurrence relations and fast algorithms
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)
Cited In (8)
- \textsf{HYPERDIRE}, hypergeometric functions differential reduction: Mathematica-based packages for differential reduction of generalized hypergeometric functions \(_pF_{p - 1}\), \(F_1\), \(F_2\), \(F_3\), \(F_4\)
- Feynman integrals as A-hypergeometric functions
- On the length of integers in telescopers for proper hypergeometric terms
- Gröbner bases for \(D\)-modules on a non-singular affine algebraic variety
- Differential reduction of generalized hypergeometric functions from Feynman diagrams: one-variable case
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
- Multiple binomial sums
- On the contiguous relations of hypergeometric series
This page was built for publication: An algorithm for finding recurrence relations of binomial sums and its complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918484)
