Doron Zeilberger, Rutgers University
Abstract: I will present five combinatorial gems where alternating paths play a major role.
Biography: Doron Zeilberger is a Board of Governors Professor of Mathematics at Rutgers University. He is widely known for the development of "WZ" (Wilf-Zeilberger) Theory and Zeilberger's algorithm that are used extensively in modern computer algebra software. Zeilberger was the first to prove the elusive result in combinatorial theory known as the alternating sign matrix conjecture. Among his honors are: the MAA Lester R. Ford award for a paper in the American Mathematical Monthly; the American Mathematical Society Steele Prize for seminal contributions to research (co-recipient with Herb Wilf); the Institute of Combinatorics and Its Applications Euler Medal for "Outstanding Contributions to Combinatorics;" the Laura H. Carnell Professorship at Temple University; in the spirit of Paul Erdos, challenge cash prizes from Richard Askey, George Andrews and Ron Graham; and Persi Diaconis's favorite living mathematician!
The citaton for the Euler Medal describes him as "a champion of using computers and algorithms to do mathematics quickly and efficiently." In his opinion "programming is even more fun than proving, and, more importantly it gives as much, if not more, insight and understanding."