A fast algorithm for proving terminating hypergeometric identities (Reprinted from Discrete Mathematics, vol 80, pg 207-211, 1990)

被引：1

作者：

Zeilberger, D ^{[1
]}

机构：

[1] Drexel Univ, Dept Math, Philadelphia, PA 19104 USA

来源：

DISCRETE MATHEMATICS | 2006年 / 306卷 / 10-11期

关键词：

D O I：

10.1016/j.disc.2006.03.026

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An algorithm for proving terminating hypergeometric identities, and thus binomial coefficients identities, is presented. It is based upon Gosper's algorithm for indefinite hypergeometric summation. A MAPLE program implementing this algorithm succeeded in proving almost all known identities. Hitherto the proof of such identities was an exclusively human endeavor. (c) 1990 Published by Elsevier B.V.

引用

页码：1072 / 1075

页数：4

共 36 条

[21] Solution of two fractional packing problems of Lovasz (Reprinted from Discrete Mathematics, vol 26, pg 177-187, 1979)
Schrijver, A
Seymour, PD
DISCRETE MATHEMATICS, 2006, 306 (10-11) : 973 - 978
[22] Automorphism groups of graphs and edge-contraction (Reprinted from Discrete Mathematics, vol 8, pg 13-20, 1974)
Babai, Laszlo
DISCRETE MATHEMATICS, 2006, 306 (10-11) : 918 - 922
[23] Explicit construction of linear sized tolerant networks (Reprinted from Discrete Mathematics, vol 72, pg 15-19, 1988)
Alon, N.
Chung, F. R. K.
DISCRETE MATHEMATICS, 2006, 306 (10-11) : 1068 - 1071
[24] A proof of Andrews' q-Dyson conjecture (Reprinted from Discrete Mathematics, vol 54, pg 201-224, 1985)
Zeilberger, D
Bressoud, DM
DISCRETE MATHEMATICS, 2006, 306 (10-11) : 1039 - 1059
[25] Group divisible designs with block-size four (Reprinted from Discrete Mathematics, vol 20, pg 1-10, 1977)
Brouwer, AE
Schrijver, A
Hanani, H
DISCRETE MATHEMATICS, 2006, 306 (10-11) : 939 - 947
[26] Limit distribution for the existence of Hamiltonian cycles in a random graph (Reprinted from Discrete Mathematics, vol 43, pg 55-63, 1983)
Komlos, Janos
Szemeredi, Endre
DISCRETE MATHEMATICS, 2006, 306 (10-11) : 1032 - 1038
[27] Risk assessment of a new high speed railway (Reprinted from IMA Journal of Mathematics Applied in Business and Industry, vol 5, pg 211-225, 1993)
Leighton, CL
Dennis, CR
QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 1995, 11 (06) : 445 - 455
[28] A fast algorithm for particle simulations (Reprinted from the Journal of Computational Physics, vol 73, pg 325-348, 1987)
Greengard, L
Rokhlin, V
JOURNAL OF COMPUTATIONAL PHYSICS, 1997, 135 (02) : 280 - 292
[29] A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Reprinted from vol 1, pg 51, 1991)
Seidel, Raimund
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (6-7): : 556 - 564
[30] Playing Fast and Loose with the Facts About the Writings of Malthus and the Classical School (Reprinted from History of Political Economy, vol 37, pg 211-218, 2005)
Moss, Laurence S.
AMERICAN JOURNAL OF ECONOMICS AND SOCIOLOGY, 2010, 69 (01) : 586 - 594

← 1 2 3 4 →