- Proof By Lice!
- The seventeen camels riddle, and Noga Alon’s camel proof and algorithms
- Edmund Landau and the Early Days of the Hebrew University of Jerusalem
- Boolean Functions: Influence, Threshold, and Noise
- Laci Babai Visits Israel!
- Polymath10 conclusion
- Is Heads-Up Poker in P?
- The Median Game
- International mathematics graduate studies at the Hebrew University of Jerusalem
Top Posts & Pages
- Proof By Lice!
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Updates and plans III.
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- From Oberwolfach: The Topological Tverberg Conjecture is False
- יופיה של המתמטיקה
- Analysis of Boolean Functions
- Greatest Hits
Tag Archives: Noga Alon
Three children inherited 17 camels. The will gave one half to one child, one third to a second child and one ninth to the third. The children did not know what to do and a neighbor offered to lend them … Continue reading
Update (Jan 21) j) Polymath11 (?) Tim Gowers’s proposed a polymath project on Frankl’s conjecture. If it will get off the ground we will have (with polymath10) two projects running in parallel which is very nice. (In the comments Jon Awbrey gave … Continue reading
Ladies and gentlemen, a conference celebrating Noga Alon’s 60th birthday is coming on January. It will take place at Tel Aviv University on January 17-21. Here is the event webpage. Don’t miss the event ! Cash Prizes! The poster includes 15 … Continue reading
Noga with Uri Feige among various other heroes A few weeks ago I devoted a post to the 240-summit conference for Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach, and today I will bring you the slides of Noga … Continue reading
Jürgen Eckhoff, Ascona 1999 Jürgen Eckhoff is a German mathematician working in the areas of convexity and combinatorics. Our mathematical paths have met a remarkable number of times. We also met quite a few times in person since our first … Continue reading
This post follows a recent paper On sunflowers and matrix multiplication by Noga Alon, Amir Spilka, and Christopher Umens (ASU11) which rely on an earlier paper Group-theoretic algorithms for matrix multiplication, by Henry Cohn, Robert Kleinberg, Balasz Szegedy, and Christopher Umans (CKSU05), … Continue reading
Recall that the -dimensional discrete cube is the set of all binary vectors ( vectors) of length n. We say that two binary vectors are adjacent if they differ in precisely one coordinate. (In other words, their Hamming distance is 1.) This … Continue reading