Recent Comments

Recent Posts
 In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 1831
 Mathematical Gymnastics
 Media Item from “Haaretz” Today: “For the first time ever…”
 Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids
 Media items on David, Amnon, and Nathan
 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?
Top Posts & Pages
 In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 1831
 Believing that the Earth is Round When it Matters
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 János Pach: Guth and Katz's Solution of Erdős's Distinct Distances Problem
 Why Quantum Computers Cannot Work: The Movie!
 In how many ways you can chose a committee of three students from a class of ten students?
 Polymath 8  a Success!
 The KadisonSinger Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
 Analysis of Boolean Functions
RSS
Category Archives: Combinatorics
Andriy Bondarenko Showed that Borsuk’s Conjecture is False for Dimensions Greater Than 65!
The news in brief Andriy V. Bondarenko proved in his remarkable paper The Borsuk Conjecture for twodistance sets that the Borsuk’s conjecture is false for all dimensions greater than 65. This is a substantial improvement of the earlier record (all dimensions … Continue reading
New Ramanujan Graphs!
Margulis’ paper Ramanujan graphs were constructed independently by Margulis and by Lubotzky, Philips and Sarnak (who also coined the name). The picture above shows Margulis’ paper where the graphs are defined and their girth is studied. (I will come back to the question … Continue reading
Posted in Algebra and Number Theory, Combinatorics, Open problems
Tagged Ramanujan graphs
10 Comments
Andrei
Andrei Zelevinsky passed away a week ago on April 10, 2013, shortly after turning sixty. Andrei was a great mathematician and a great person. I first met him in a combinatorics conference in Stockholm 1989. This was the first major … Continue reading
Test Your Intuition (19): The Advantage of the Proposers in the Stable Matching Algorithm
Stable mariage The GaleShapley stable matching theorem and the algorithm. GALESHAPLEY THEOREM Consider a society of n men and n women and suppose that every man [and every woman] have a preference (linear) relation on the women [men] he [she] knows. Then … Continue reading
Erdős’ Birthday
Paul Erdős was born on March 26, 1913 2013 a hundred years ago. This picture (from Ehud Friedgut’s homepage) was taken in September ’96 in a Chinese restaurant in Warsaw, a few days before Paul Erdős passed away. The other diners are Svante Janson, Tomasz Łuczack and … Continue reading
Lionel Pournin found a combinatorial proof for SleatorTarjanThurston diameter result
I just saw in Claire Mathieu’s blog “A CS professor blog” that a simple proof of the SleatorTarjanThurston’s diameter result for the graph of the associahedron was found by Lionel Pournin! Here are slides of his lecture “The diameters of associahedra” … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Convex polytopes
Tagged Associahedron, Lionel Pournin
1 Comment
Happy Birthday Ron Aharoni!
Ron Aharoni, one of Israel’s and the world’s leading combinatorialists celebrated his birthday last month. This is a wonderful opportunity to tell you about a few of the things that Ron did mainly around matching theory. Menger’s theorem for infinite … Continue reading
The Quantum Debate is Over! (and other Updates)
Quid est noster computationis mundus? Nine months after is started, (much longer than expected,) and after eight posts on GLL, (much more than planned,) and almost a thousand comments of overall good quality, from quite a few participants, my … Continue reading
Looking Again at Erdős’ Discrepancy Problem
Over Gowers’s blog Tim and I will make an attempt to revisit polymath5. Last Autumn I prepared three posts on the problems and we decided to launch them now. The first post is here. Here is a related MathOverflow question. … Continue reading