David P. Robbins Prize

Last updated

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.

Contents

Winners (AMS Robbins Prize)

Winners (MAA Robbins Prize)

See also

Related Research Articles

<span class="mw-page-title-main">Ronald Graham</span> American mathematician (1935–2020)

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.

<span class="mw-page-title-main">Doron Zeilberger</span> Mathematician

Doron Zeilberger is an Israeli-American mathematician, known for his work in combinatorics.

<i>The Mathematical Intelligencer</i> Academic journal

The Mathematical Intelligencer is a mathematical journal published by Springer Science+Business Media that aims at a conversational and scholarly tone, rather than the technical and specialist tone more common among academic journals. Volumes are released quarterly with a subset of open access articles. Some articles have been cross-published in the Scientific American. Karen Parshall and Sergei Tabachnikov are currently the co-editors-in-chief.

<span class="mw-page-title-main">Alexander Razborov</span> Russian mathematician

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.

<i>Proofs from THE BOOK</i> 1998 mathematics book by Aigner and Ziegler

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."

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

<span class="mw-page-title-main">Václav Chvátal</span> Czech-Canadian mathematician

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.

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.

Combinatorica is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are Imre Bárány and József Solymosi. The advisory board consists of Ronald Graham, Gyula O. H. Katona, Miklós Simonovits, Vera Sós, and Endre Szemerédi. It is published by the János Bolyai Mathematical Society and Springer Verlag.

The progression of both the nature of mathematics and individual mathematical problems into the future is a widely debated topic; many past predictions about modern mathematics have been misplaced or completely false, so there is reason to believe that many predictions today will follow a similar path. However, the subject still carries an important weight and has been written about by many notable mathematicians. Typically, they are motivated by a desire to set a research agenda to direct efforts to specific problems, or a wish to clarify, update and extrapolate the way that subdisciplines relate to the general discipline of mathematics and its possibilities. Examples of agendas pushing for progress in specific areas in the future, historical and recent, include Felix Klein's Erlangen program, Hilbert's problems, Langlands program, and the Millennium Prize Problems. In the Mathematics Subject Classification section 01Axx History of mathematics and mathematicians, subsection 01A67 is titled Future prospectives.

<span class="mw-page-title-main">Harald Helfgott</span> Peruvian mathematician

Harald Andrés Helfgott is a Peruvian mathematician working in number theory. Helfgott is a researcher at the CNRS at the Institut Mathématique de Jussieu, Paris. He is best known for submitting a proof, now widely accepted but not yet fully published, of Goldbach's weak conjecture.

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).

Daniel Kráľ is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the Masaryk University. His research primarily concerns graph theory and graph algorithms.

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.

Using the Borsuk–Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry is a graduate-level mathematics textbook in topological combinatorics. It describes the use of results in topology, and in particular the Borsuk–Ulam theorem, to prove theorems in combinatorics and discrete geometry. It was written by Czech mathematician Jiří Matoušek, and published in 2003 by Springer-Verlag in their Universitext series (ISBN 978-3-540-00362-5).

<span class="mw-page-title-main">József Balogh (mathematician)</span> Hungarian mathematician

József Balogh is a Hungarian-American mathematician, specializing in graph theory and combinatorics.

References

  1. Morier-Genoud, S.; Ovsienko, V. (2020-03-06). "q-deformed rationals and q-continued fractions". Forum of Mathematics, Sigma. 8 (e13). Cambridge University Press. arXiv: 1812.00170 . doi:10.1017/fms.2020.9. ISSN   2050-5094.
  2. Bostan, A.; Kurkova, I.; Raschel, K. (2016-04-14). "A human proof of Gessel's lattice path conjecture". Transactions of the American Mathematical Society. 369 (2). American Mathematical Society (AMS): 1365–1393. arXiv: 1309.1023 . doi:10.1090/tran/6804. ISSN   0002-9947. S2CID   11810630.
  3. "News from the AMS".
  4. "Proof of the q-TSPP conjecture". www.koutschan.de.
  5. Razborov: On the minimal density of triangles in graphs
  6. "The On-Line Encyclopedia of Integer Sequences® (OEIS®)". oeis.org.