论文信息 - A high-tech proof of the Mills-Robbins-Rumsey determinant formula - 字舞流文

A high-tech proof of the Mills-Robbins-Rumsey determinant formula

We give a computer generated proof of the formula of the title, based on Zeilberger's algorithm and a method of George Andrews.

Marko Petkovsek | Herbert S. Wilf | H. Wilf | M. Petkovšek

[1] David P. Robbins,et al. Enumeration of a symmetry class of plane partitions , 1987, Discret. Math..

[2] Doron Zeilberger,et al. The Method of Creative Telescoping , 1991, J. Symb. Comput..

[3] Peter Paule,et al. A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities , 1995, J. Symb. Comput..

[4] George E. Andrews,et al. Pfaff's method (I): The Mills-Robbins-Rumsey determinant , 1998, Discret. Math..

[5] W. A. Al-Salam,et al. On Quadratic Transformations of Basic Series , 1984 .

[6] Ira M. Gessel,et al. Applications of q-lagrange inversion to basic hypergeometric series , 1983 .

[7] Doron Zeilberger,et al. An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities , 1992 .

[8] David P. Robbins,et al. The Story of 1, 2, 7, 42, 429, 7436, … , 1991 .

[9] George Gasper,et al. Summation, transformation, and expansion formulas for bibasic series , 1989 .

[10] Doron Zeilberger,et al. A fast algorithm for proving terminating hypergeometric identities , 1990, Discret. Math..

[11] Peter Paule,et al. Greatest Factorial Factorization and Symbolic Summation , 1995, J. Symb. Comput..

[12] Barry Mazur,et al. This is the Story. , 1952, Canadian Medical Association journal.

[13] Mizan Rahman,et al. Basic Hypergeometric Series , 1990 .