Doron Zeilberger
.jpg)
Doron Zeilberger (דורון ציילברגר, born 2 July 1950 in Haifa, Israel) is an Israeli mathematician, known for his work in combinatorics.
Education and career
He received his doctorate from the Weizmann Institute of Science in 1976, under the direction of Harry Dym.[1] He is a Board of Governors Professor of Mathematics at Rutgers University.[2]
Contributions
Zeilberger has made numerous important contributions to combinatorics, hypergeometric identities, and q-series. Zeilberger gave the first proof of the alternating sign matrix conjecture, noteworthy not only for its mathematical content, but also for the fact that Zeilberger recruited nearly a hundred volunteer checkers to "pre-referee" the paper. In 2011, together with Manuel Kauers and Christoph Koutschan, Zeilberger proved the q-TSPP conjecture, which was independently stated in 1983 by George Andrews and David P. Robbins.[3]
Zeilberger considers himself an ultrafinitist.[4] He is also known for crediting his computer "Shalosh B. Ekhad" as a co-author ("Shalosh" and "Ekhad" mean "Three" and "One" in Hebrew respectively, referring to his first computer, an AT&T 3B1[5]), and for his provocative opinions, some of which are:
- "The Shocking State of Contemporary "Mathematics", and the Meta-Shocking Fact that Very Few People Are Shocked"
- "People who believe that applied math is bad math are bad mathematicians"
- "Guess what? Programming is even more fun than proving, and, more importantly it gives as much, if not more, insight and understanding"
- "Frank Quinn's rigor is not as rigorous as he thinks"
- "Still like that old-time blackboard talk".
Awards and honors
Zeilberger received a Lester R. Ford Award in 1990.[6] Together with Herbert Wilf, Zeilberger was awarded the American Mathematical Society's Leroy P. Steele Prize for Seminal Contributions to Research in 1998 for their development of WZ theory, which has revolutionized the field of hypergeometric summation. In 2004, Zeilberger was awarded the Euler Medal; the citation refers to him as "a champion of using computers and algorithms to do mathematics quickly and efficiently."
In 2012 he became a fellow of the American Mathematical Society.[7]
See also
References
- ↑ Doron Zeilberger at the Mathematics Genealogy Project
- ↑ Rutgers Focus, 15 December 2000
- ↑ Koutschan, C., Kauers, M., and Zeilberger, D., Proof of George Andrews’s and David Robbins’s q-TSPP conjecture, Proc. Natl. Acad. Sci. USA 108 (2011), 2196–2199.
- ↑ An Enquiry Concerning Human (and Computer!) (Mathematical) Understanding
- ↑ Gallian, J. and Pearson, M., An Interview with Doron Zeilberger FOCUS 27 (2007), 14–17.
- ↑ Zeilberger, Doron (1989). "Kathy O'Hara's constructive proof of the unimodality of the Gaussian polynomials". Amer. Math. Monthly 96: 590–602. doi:10.2307/2325177.
- ↑ List of Fellows of the American Mathematical Society, retrieved 2013-09-01.
External links
 |
Wikiquote has quotations related to: Doron Zeilberger |
- Doron Zeilberger's homepage
- Biography from ScienceWorld
- Weisstein, Eric W., "Zeilberger's Algorithm", MathWorld.
- Weisstein, Eric W., "Wilf-Zeilberger Pair", MathWorld.
- Weisstein, Eric W., "Alternating Sign Matrix Conjecture", MathWorld.
- Weisstein, Eric W., "Refined Alternating Sign Matrix Conjecture", MathWorld.
- Weisstein, Eric W., "Zeilberger-Bressoud Theorem", MathWorld.
- From A = B to Z = 60, a conference in honor of Doron Zeilberger's 60th birthday, 27 and 28 May 2010
|