Author Archives: Gil Kalai

Algorithmic Game Theory: Past, Present, and Future

Noam Nisan is 60 Today, June 26 2022, is the opening day of Algorithmic Game Theory: Past, Present, and Future, a workshop in honor of Noam Nisan’s 60th Birthday. The workshop takes place on June 26-30 2022, at the CS … Continue reading

Posted in Academics, Economics, Games, Updates | Leave a comment

Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s

In his comment to the previous post by Igor Pak, Joe Malkevitch referred us to a wonderful paper by Richard Stanley on enumerative and algebraic combinatorics in the 1960’s and 1970’s. See also this post on Richard’s memories regarding the … Continue reading

Posted in Combinatorics, What is Mathematics | Tagged | 1 Comment

Igor Pak: How I chose Enumerative Combinatorics

Originally posted on Igor Pak's blog:
Apologies for not writing anything for awhile. After Feb 24, the math part of the “life and math” slogan lost a bit of relevance, while the actual events were stupefying to the point…

Posted in Combinatorics, What is Mathematics | Tagged | 1 Comment

Quantum Computers: A Brief Assessment of Progress in the Past Decade

In this post I give a brief  assessment of progress in the past decade, triggered by a recent article in Forbes Magazine that mentions my view on the matter. Waging War On Quantum – A Forbes Article by Arthur Herman … Continue reading

Posted in Quantum | Tagged , | 11 Comments

Noga Alon and Udi Hrushovski won the 2022 Shaw Prize

Noga Alon, yesterday at TAU, with his long-time collaborators and former students Michael Krivelevich and Benny Sudakov (left) Udi Hrushovski (right) Heartfelt congratulations to Noga Alon and to Ehud (Udi) Hrushovski for winning the 2022 Shaw Prize in Mathematical Sciences! … Continue reading

Posted in Uncategorized | Tagged , , | 7 Comments

Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem

Norbert Sauer The news in brief:  In the new paper Resolution of the Erdős-Sauer problem on regular subgraphs Oliver Janzer and Benny Sudakov proved that any graph G with vertices and more than edges contains a k-regular subgraph. This bound … Continue reading

Posted in Combinatorics | Tagged , | 1 Comment

Past and Future Events

Quick announcements of past (recorded) and future events 1) Shachar Lovett was the Erdos Speaker for 2022 and his great talks are recorded. (Lecture 1, Tensor ranks and their applications lecture 2, The monomial structure of Boolean functions, lecture 3, … Continue reading

Posted in Combinatorics, Conferences, Convexity, Geometry, Quantum | Leave a comment

Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.

Joshua Hinman proved Bárány’s conjecture. One of my first posts on this blog was a 2008 post Five Open Problems Regarding Convex Polytopes, now 14 years later, I can tell you about the first problem on the list to get solved. … Continue reading

Posted in Combinatorics, Convex polytopes | Tagged , , , | 4 Comments

Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!

A brief summary: In the paper, A proof of the Kahn-Kalai conjecture, Jinyoung Park and Huy Tuan Pham proved the 2006 expectation threshold conjecture posed by Jeff Kahn and me. The proof is wonderful. Congratulations Jinyoung and Huy Tuan! Updates: … Continue reading

Posted in Combinatorics, Probability | Tagged , | 5 Comments

Combinatorial Convexity: A Wonderful New Book by Imre Bárány

A few days ago I received by mail Imre Bárány’s new book Combinatorial Convexity. The book presents Helly-type theorems and other results in convexity with combinatorial flavour. The choice of material and the choice of proofs is terrific and it … Continue reading

Posted in Combinatorics, Convexity, Geometry | Tagged | Leave a comment