This article needs additional citations for verification .(October 2015) |
The David P. Robbins Prize for papers reporting novel research in algebra, combinatorics, or discrete mathematics is awarded both by the American Mathematical Society (AMS) and by the Mathematical Association of America (MAA). The AMS award recognizes papers with a significant experimental component on a topic which is broadly accessible which provide a simple statement of the problem and clear exposition of the work. Papers eligible for the MAA award are judged on quality of research, clarity of exposition, and accessibility to undergraduates. Both awards consist of $5000 and are awarded once every three years. They are named in the honor of David P. Robbins and were established in 2005 by the members of his family.
Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.
Paul D. Seymour is a British mathematician known for his work in discrete mathematics, especially graph theory. He was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers are available from his website.
Doron Zeilberger is an Israeli mathematician, known for his work in combinatorics.
Aleksandr Aleksandrovich Razborov, sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist. He is Andrew McLeish Distinguished Service Professor at the University of Chicago.
The Morgan Prize is an annual award given to an undergraduate student in the US, Canada, or Mexico who demonstrates superior mathematics research. The $1,200 award, endowed by Mrs. Frank Morgan of Allentown, Pennsylvania, was founded in 1995. The award is made jointly by the American Mathematical Society, the Mathematical Association of America, and the Society for Industrial and Applied Mathematics. The Morgan Prize has been described as the highest honor given to an undergraduate in mathematics.
Proofs from THE BOOK is a book of mathematical proofs by Martin Aigner and Günter M. Ziegler. The book is dedicated to the mathematician Paul Erdős, who often referred to "The Book" in which God keeps the most elegant proof of each mathematical theorem. During a lecture in 1985, Erdős said, "You don't have to believe in God, but you should believe in The Book."
David Peter Robbins was an American mathematician. He is most famous for introducing alternating sign matrices. He is also known for his work on generalizations of Heron's formula on the area of polygons, due to which Robbins pentagons were named after him.
Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.
Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.
András Hajnal was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known for his work in set theory and combinatorics.
Edward R. Scheinerman is an American mathematician, working in graph theory and order theory. He is a professor of applied mathematics, statistics, and computer science at Johns Hopkins University. His contributions to mathematics include Scheinerman's conjecture, now proven, stating that every planar graph may be represented as an intersection graph of line segments.
Manuel Kauers is a German mathematician and computer scientist. He is working on computer algebra and its applications to discrete mathematics. He is currently professor for algebra at Johannes Kepler University (JKU) in Linz, Austria, and leader of the Institute for Algebra at JKU. Before that, he was affiliated with that university's Research Institute for Symbolic Computation (RISC).
Christoph Koutschan is a German mathematician and computer scientist. He is currently with the Johann Radon Institute for Computational and Applied Mathematics (RICAM) of the Austrian Academy of Sciences.
Ira Martin Gessel is an American mathematician, known for his work in combinatorics. He is a long-time faculty member at Brandeis University and resides in Arlington, Massachusetts.
Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference.
József Balogh is a Hungarian-American mathematician, specializing in graph theory and combinatorics.
The Philippe Flajolet Lecture Prize is awarded to for contributions to analytic combinatorics and analysis of algorithms, in the fields of theoretical computer science. This prize is named in memory of Philippe Flajolet.
Hunter Snevily (1956–2013) was an American mathematician with expertise and contributions in Set theory, Graph theory, Discrete geometry, and Ramsey theory on the integers.