Recent Comments

Recent Posts
 Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
 Happy Birthday Ervin, János, Péter, and Zoli!
 My Mathematical Dialogue with Jürgen Eckhoff
 Test Your Intuition (23): How Many Women?
 Happy Birthday Richard Stanley!
 Influence, Threshold, and Noise
 Erdős Lectures 2014 – Dan Spielman
 Answer to Test Your Intuition (22)
 Test your intuition (22): Selling Two Items in a Bundle.
Top Posts & Pages
 The KadisonSinger Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
 Believing that the Earth is Round When it Matters
 Test Your Intuition (23): How Many Women?
 Polymath 8  a Success!
 Emmanuel Abbe: Erdal Arıkan's Polar Codes
 Why Quantum Computers Cannot Work: The Movie!
 'Gina Says'
 Analysis of Boolean Functions
 Five Open Problems Regarding Convex Polytopes
RSS
Author Archives: Gil Kalai
Levon Khachatrian’s Memorial Conference in Yerevan
Workshop announcement The National Academy of Sciences of Armenia together American University of Armenia are organizing a memorial workshop on extremal combinatorics, cryptography and coding theory dedicated to the 60th anniversary of the mathematician Levon Khachatrian. Professor Khachatrian started his … Continue reading
NavierStokes Fluid Computers
Smart fluid Terry Tao posted a very intriguing post on the NavierStokes equation, based on a recently uploaded paper Finite time blowup for an averaged threedimensional NavierStokes equation. The paper proved a remarkable negative answer for the regularity conjecture for a certain … Continue reading
Pictures from Recent Quantum Months
A special slide I prepared for my lecture at Gdansk featuring Robert Alicki and I as climber on the mountain of quantum computers “because it is not there.” It has been quite a while since I posted here about quantum … Continue reading
Posted in Conferences, Quantum, Updates
Tagged Aram Harrow, Connie Sidles, John Sidles, Michal Horodecki, Michel Dyakonov, Quantum computers, Rico Picone, Robert Alicki, Updates, Yuri Gurevich
3 Comments
Joel David Hamkins’ 1000th MO Answer is Coming
Update (May 2014): The second MO contributor to answer 1000 questions is another distinguished mathematician (and a firend) Igor Rivin. Joel David Hamkins’ profile over MathOverflow reads: “My main research interest lies in mathematical logic, particularly set theory, focusing on the … Continue reading
Amazing: Peter Keevash Constructed General Steiner Systems and Designs
Here is one of the central and oldest problems in combinatorics: Problem: Can you find a collection S of qsubsets from an nelement set X set so that every rsubset of X is included in precisely λ sets in the collection? … Continue reading
Many Short Updates
Things in Berkeley and later here in Jerusalem were very hectic so I did not blog much since mid October. Much have happened so let me give brief and scattered highlights review. Two “real analysis” workshops at the Simons Institute … Continue reading
Posted in Conferences, Updates
4 Comments
Many triangulated threespheres!
The news Eran Nevo and Stedman Wilson have constructed triangulations with n vertices of the 3dimensional sphere! This settled an old problem which stood open for several decades. Here is a link to their paper How many nvertex triangulations does the 3 … Continue reading
Posted in Combinatorics, Convex polytopes, Geometry, Open problems
Tagged Eran Nevo, Stedman Wilson
Leave a comment
NatiFest is Coming
The conference Poster as designed by Rotem Linial A conference celebrating Nati Linial’s 60th birthday will take place in Jerusalem December 1618. Here is the conference’s webpage. To celebrate the event, I will reblog my very early 2008 post “Nati’s … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates
Tagged Nati Linial
2 Comments
More around Borsuk
Piotr Achinger told me two things abour Karol Borsuk: From Wikipedea: Dunce hat Folding. The blue hole is only for better view Borsuk trumpet is another name for the contractible noncollapsible space commonly called also the “dunce hat“. (See … Continue reading
Analysis of Boolean Functions – Week 7
Lecture 11 The Cap Set problem We presented Meshulam’s bound for the maximum number of elements in a subset A of not containing a triple x,y,x of distinct elements whose sum is 0. The theorem is analogous to Roth’s theorem … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Teaching
Tagged Cap set problem, Codes, Linearity testing
Leave a comment