An algorithm for finding recurrence relations of binomial sums and its complexity

DOI10.1006/jsco.1995.1069zbMath0849.68056OpenAlexW1964293744MaRDI QIDQ1918484

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

zbMATH Keywords

hypergeometric functionsrecurrence relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

Gröbner bases for \(D\)-modules on a non-singular affine algebraic variety, Multiple binomial sums, Differential reduction of generalized hypergeometric functions from Feynman diagrams: one-variable case, On the length of integers in telescopers for proper hypergeometric terms, On the contiguous relations of hypergeometric series, Feynman integrals as A-hypergeometric functions