From stanton@math.umn.edu Mon Nov 11 12:51:43 1996 Received: from math.umn.edu (root@baobab.math.umn.edu [128.101.154.28]) by euclid.math.temple.edu (8.7.4/8.6.12) with ESMTP id MAA22629 for ; Mon, 11 Nov 1996 12:51:42 -0500 (EST) Posted-Date: Mon, 11 Nov 1996 12:51:42 -0500 (EST) Received-Date: Mon, 11 Nov 1996 12:51:42 -0500 (EST) Received: from hemlock.math.umn.edu (stanton@hemlock.math.umn.edu [128.101.154.102]) by math.umn.edu (8.7.5/8.7.2) with ESMTP id LAA04282; Mon, 11 Nov 1996 11:53:35 -0600 (CST) Received: (from stanton@localhost) by hemlock.math.umn.edu (8.7.5/8.7.2) id LAA24039; Mon, 11 Nov 1996 11:49:45 -0600 (CST) Date: Mon, 11 Nov 1996 11:49:45 -0600 (CST) From: Dennis Stanton Message-Id: <199611111749.LAA24039@hemlock.math.umn.edu> To: reiner@math.umn.edu, zeilberg@euclid.math.temple.edu Subject: seminar talk X-Sun-Charset: US-ASCII Status: R Vic and Doron: My seminar talk next Monday. TITLE: Is Ekhad a hypochondriac? the Andrews syndrome ABSTRACT: George Andrews and Doron Zeilberger/Shalosh B. Ekhad have had a continuing dialogue on certain 5F4 evaluations. Andrews proved a 5F4=0, which Ekhad (due to an apparent coding typo) could not prove. Andrews also proved 29 others using contiguous relations, Upon correcting the typo, Ekhad could prove only 2 of these 30 evaluations. Recently an improved Zeilberger/Ekhad version appeared in "Curing the Andrews syndrome". In this paper the authors offer to prove each identity for a donation of $300, because the required computing time is substantial. I will prove over 100 such 5F4 evaluations, including all 30 given by Andrews. The idea is to give a single 6F5 transformation which proves many (>20) 6F5 evaluations, and each 6F5 evaluation proves 9 1-balanced 5F4 evaluations. Again cubic transformations of 3F2's are the key starting points.