When does Zeilberger's algorithm succeed?
type: Item
instance of: scholarly article
title: When does Zeilberger's algorithm succeed?
zbMATH Open document ID: 1030.33011
DOI: 10.1016/S0196-8858(02)00504-3
published in: Advances in Applied Mathematics
publication date: 2003-09-15T00:00:00Z
review text: The author presents a terminating condition of the Zeilberger's algorithm for a given hypergeometric term \(T(n,k)\). Some examples are given.
Mathematics Subject Classification ID: 33F10
zbMATH DE Number: 1981405
zbMATH Keywords: Zeilberger's algorithm
author: S. A. Abramov
reviewed by: Hans Benker
MaRDI profile type: Publication
cites work: Q4091406
cites work: Q4227315
cites work: Q4660678
cites work: Q4502525
cites work: Minimal decomposition of indefinite hypergeometric sums
cites work: Rational normal forms and minimal decompositions of hypergeometric terms
cites work: On the structure of multivariate hypergeometric terms.
cites work: Q5678871
cites work: Q4320535
cites work: Hypergeometric solutions of linear recurrences with polynomial coefficients
cites work: Q4875364
cites work: Rational summation and Gosper-Petkovšek representation
cites work: Theory of prehomogeneous vector spaces (algebraic part)—the English translation of Sato’s lecture from Shintani’s note
cites work: An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)'') multisum/integral identities
cites work: The method of creative telescoping
description: scientific article; zbMATH DE number 1981405