George Pólya Prize
The George Pólya Prize is a prize in mathematics, awarded by the Society for Industrial and Applied Mathematics.[1] First given in 1969, the prize is named after Hungarian mathematician George Pólya. It is now awarded in evenly numbered years. Starting in 1969 the prize money was provided by Frank Harary, who donated the profits from his Graph Theory book. At some point SIAM took it over.
The prize is given every two years, alternately in two categories: (1) for a notable application of combinatorial theory; (2) for a notable contribution in another area of interest to George Pólya such as approximation theory, complex analysis, number theory, orthogonal polynomials, probability theory, or mathematical discovery and learning.
The prize is broadly intended to recognize specific recent work. Prize committees may occasionally consider an award for cumulative work, but such awards should be rare.
Winners
- 1971 Ronald L. Graham, Klaus Leeb, B. L. Rothschild, A. W. Hales, and R. I. Jewett
- 1975 Richard P. Stanley, Endre Szemerédi, and Richard M. Wilson
- 1979 László Lovász
- 1983 Anders Björner and Paul Seymour
- 1987 Andrew Yao
- 1992 Gil Kalai and Saharon Shelah
- 1994 Gregory Chudnovsky and Harry Kesten
- 1996 Jeff Kahn and David Reimer
- 1998 Percy Deift, Xin Zhou, and Peter Sarnak
- 2000 Noga Alon
- 2002 Craig Tracy and Harold Widom
- 2004 Neil Robertson and Paul Seymour
- 2006 Gregory F. Lawler, Oded Schramm, Wendelin Werner
- 2008 Van H. Vu
- 2010 Emmanuel Candès and Terence Tao
- 2012 Vojtěch Rödl and Mathias Schacht
- 2014 Adam Marcus, Daniel Spielman and Nikhil Srivastava[2]
References
- ↑ "George Polya Prize". Retrieved 11 July 2014.
- ↑ "Indian wins prestigious George Polya Prize for solving Maths Riddle". IANS. news.biharprabha.com. Retrieved 11 July 2014.