Author Archives: Gil Kalai

Problems for Imre Bárány’s Birthday!

  On June 18-23 2017 we will celebrate in Budapest the 70th birthday of Imre Bárány. Here is the webpage of the conference. For the occasion I wrote a short paper with problems in discrete geometry, mainly around Helly’s and … Continue reading

Posted in Combinatorics, Conferences, Open problems | Tagged | Leave a comment

Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria

Very nice mathematical videos!

Posted in Academics, Movies, What is Mathematics | Leave a comment

Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science

                            May 4 2:30-3:30; May 7 11:00-13:00; May 10 10:30-12:00 See the event webpage for titles and abstracts (or click on the picture below).  

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

Updates (belated) Between New Haven, Jerusalem, and Tel-Aviv

This is a (very much) belated update post from the beginning of March (2016). New Haven I spent six weeks in February (2016) in New Haven. It was very nice to get back to Yale after more than two years. Here … Continue reading

Posted in Art, Combinatorics, Computer Science and Optimization, Number theory, Updates | Leave a comment

Oded Goldreich Fest

Update (April 17): Outcomes of the poll for the coolest title are in. (See the end of the post) Oded Goldreich’s 60 birthday meeting, April 19-20 at the Weitzmann Institute promises to be a great event. Here is the webpage … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Conferences | Tagged | 1 Comment

The Race to Quantum Technologies and Quantum Computers (Useful Links)

One of my main research directions in the last decade is  quantum information theory and quantum computers. (See this post and this one.) It is therefore a pleasure to report and give many links on the massive efforts carried out these … Continue reading

Posted in Computer Science and Optimization, Physics, Quantum | Tagged , , , , , | 11 Comments

Around the Garsia-Stanley’s Partitioning Conjecture

  Art Duval, Bennet Goeckner, Carly Klivans, and Jeremy Martin found a counter example to the Garsia-Stanley partitioning conjecture for Cohen-Macaulay complexes. (We mentioned the conjecture here.)  Congratulations Art, Bennet, Carly and Jeremy!  Art, Carly, and Jeremy also wrote an article on the … Continue reading

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

My Answer to TYI- 28

The fifteen remarkable individuals in the previous post are all the recipients of the  SIGACT Distinguished Service Prize since it was established in 1997. The most striking common feature to all of them is, in my view, that they are all … Continue reading

Posted in Computer Science and Optimization, Women in science | Tagged , | 2 Comments

Test your intuition 28: What is the most striking common feature to all these remarkable individuals

Test your intuition: What is the most striking common feature to all these fifteen remarkable individuals László Babai; Avi Wigderson; Lance Fortnow; Lane Hemaspaandra; Sampath Kannan; Hal Gabow; Richard Karp; Tom Leighton; Rockford J. Ross; Alan Selman; Michael Langston; S. … Continue reading

Posted in Computer Science and Optimization, Test your intuition | 1 Comment

R(5,5) ≤ 48

The Ramsey numbers R(s,t) The Ramsey number R(s, t) is defined to be the smallest n such that every graph of order n contains either a clique of s vertices or an independent set of t vertices. Understanding the values … Continue reading

Posted in Combinatorics, Open problems, Updates | Tagged , | Leave a comment