kazekkurz on More around Borsuk Gil Kalai on More around Borsuk kazekkurz on More around Borsuk Gil Kalai on Polymath 8 – a Succ… Patrick Poirier on About Alon Amit on NatiFest is Coming Abdulrahman Oladiipu… on The Kadison-Singer Conjecture… More around Borsuk |… on Helly’s Theorem, “… Gil Kalai on Polymath 8 – a Succ… Gil Kalai on Greg Kuperberg: It is in NP to… dmoskovich on Greg Kuperberg: It is in NP to… zhang twin prime bre… on Polymath 8 – a Succ…
- Many triangulated three-spheres!
- NatiFest is Coming
- More around Borsuk
- Analysis of Boolean Functions – Week 7
- Analysis of Boolean Functions week 5 and 6
- Real Analysis Introductory Mini-courses at Simons Institute
- Analysis of Boolean Functions – week 4
- Polymath 8 – a Success!
- Analysis of Boolean Functions – Week 3
Top Posts & Pages
- NatiFest is Coming
- Polymath 8 - a Success!
- Analysis of Boolean Functions
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Believing that the Earth is Round When it Matters
- Why is Mathematics Possible: Tim Gowers's Take on the Matter
- 'Gina Says'
- Happy Birthday Ron Aharoni!
Author Archives: Gil Kalai
Raghu Meka talking at the workshop I spend the semester in Berkeley at the newly founded Simons Institute for the Theory of Computing. The first two programs demonstrate well the scope of the center and why it is needed. One program … Continue reading
Post on week 1; home page of the course analysis of Boolean functions Lecture II: We discussed two important examples that were introduced by Ben-Or and Linial: Recursive majority and tribes. Recursive majority (RM): is a Boolean function with variables … Continue reading
Borsuk asked in 1933 if every bounded set K of diameter 1 in can be covered by d+1 sets of smaller diameter. A positive answer was referred to as the ”Borsuk Conjecture,” and it was disproved by Jeff Kahn and me in 1993. … Continue reading
Home page of the course. In the first lecture I defined the discrete n-dimensional cube and Boolean functions. Then I moved to discuss five problems in extremal combinatorics dealing with intersecting families of sets. 1) The largest possible intersecting family … Continue reading
After much hesitation, I decided to share with you the videos of my lecture: Open collaborative mathematics over the internet – three examples, that I gave last January in Doron Zeilberger’s seminar at Rutgers on experimental mathematics. Parts of the 47-minutes … Continue reading
Michal Karonski (left) who built Poland’s probabilistic combinatorics group at Poznań, and a sculpture honoring the Polish mathematicians who first broke the Enigma machine (right, with David Conlon, picture taken by Jacob Fox). I am visiting now Poznań for the 16th … Continue reading
Following are some preliminary observations connecting BosonSampling, an interesting computational task that quantum computers can perform (that we discussed in this post), and noise-sensitivity in the sense of Benjamini, Schramm, and myself (that we discussed here and here.) BosonSampling and computational-complexity hierarchy-collapse Suppose that … Continue reading
David Wilson and a cover of Shlomo’s recent book “Curvature in mathematics and physics” A few weeks ago, in David Kazhdan’s basic notion seminar, Shlomo Sternberg gave a lovely presentation Kirchhoff and Wilson via Kozdron and Stroock. The lecture is based on … Continue reading
Reshef, Moshe and Sam The question: (based on discussions with Reshef Meir, Moshe Tennenholtz, and Sam Payne) Tic Tac Toe is played since anciant times. For the common version, where the two players X and O take turns in marking … Continue reading
Paul Erdős in Jerusalem, 1933 1993 I just came back from a great Erdős Centennial conference in wonderful Budapest. I gave a lecture on old and new problems (mainly) in combinatorics and geometry (here are the slides), where I presented twenty … Continue reading