Recent Comments

Recent Posts
 Problems for Imre Bárány’s Birthday!
 Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
 Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
 Updates (belated) Between New Haven, Jerusalem, and TelAviv
 Oded Goldreich Fest
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 Around the GarsiaStanley’s Partitioning Conjecture
 My Answer to TYI 28
 Test your intuition 28: What is the most striking common feature to all these remarkable individuals
Top Posts & Pages
 Problems for Imre Bárány's Birthday!
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 Believing that the Earth is Round When it Matters
 Polynomial Method Workshop
 When It Rains It Pours
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
RSS
Author Archives: Gil Kalai
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:303:30; May 7 11:0013:00; May 10 10:3012:00 See the event webpage for titles and abstracts (or click on the picture below).
Updates (belated) Between New Haven, Jerusalem, and TelAviv
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
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 1920 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 Oded Goldreich
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
Around the GarsiaStanley’s Partitioning Conjecture
Art Duval, Bennet Goeckner, Carly Klivans, and Jeremy Martin found a counter example to the GarsiaStanley partitioning conjecture for CohenMacaulay 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 Art Duval, Bennet Goeckner, Carly Klivans, GarsiaStanley conjecture, Jeremy Martin, Ping Zhang
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 SIGACT, Women in science
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
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 Brendan D. McKay, Vigleik Angeltveit
Leave a comment