|
|
|||||||||||||||
Time & location: All meetings are Thursdays in Gibson Hall 414 at 2:00.
Form an n by n array of 0, -1 and +1 with the condition that the sum of rows and columns is +1 and that the non-zero entries alternate in sign. The question of how many of these arrays are there was open for a long time. It as finally solved by Doron Zeilberger. David Bressoud has written a beautiful book explaning the proof. In this seminar we will discuss these issues: they include partitions, generating functions, infinite products, ice lattices, and many more apparently disconnected topics.
For information, contact Victor Moll
![]()
| Mathematics
Department Tulane University 6823 St. Charles Ave New Orleans, LA 70118 phone: (504) 865-5727 fax: (504) 865-5063 |
Last Updated:
October 2, 2007
|
|