Recent Comments

Recent Posts
 High Dimensional Combinatorics at the IIAS – Program Starts this Week; My course on Hellytype theorems; A workshop in Sde Boker
 Stan Wagon, TYI 23: Ladies and Gentlemen: The Answer
 Ladies and Gentlemen, Stan Wagon: TYI 32 – A Cake Problem.
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 Sergiu Hart: TwoVote or not to Vote
 A toast to Alistair: Two Minutes on Two Great Professional Surprises
 TYI 31 – Rados Radoicic’s Rope Problem
 Eran Nevo: gconjecture part 4, Generalizations and Special Cases
 The World of Michael Burt: When Architecture, Mathematics, and Art meet.
Top Posts & Pages
 High Dimensional Combinatorics at the IIAS  Program Starts this Week; My course on Hellytype theorems; A workshop in Sde Boker
 Stan Wagon, TYI 23: Ladies and Gentlemen: The Answer
 Ladies and Gentlemen, Stan Wagon: TYI 32  A Cake Problem.
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 TYI 30: Expected number of Dice throws
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 יופיה של המתמטיקה
RSS
Search Results for: erdos
Combinatorics and More – Greatest Hits
Combinatorics and More’s Greatest Hits First Month Combinatorics, Mathematics, Academics, Polemics, … Helly’s Theorem, “Hypertrees”, and Strange Enumeration I (There were 3 follow up posts:) Extremal Combinatorics I: Extremal Problems on Set Systems (There were 4 follow up posts II ; III; IV; VI) Drachmas Rationality, Economics and … Continue reading
Posted in Uncategorized
Leave a comment
Greatest Hits
Combinatorics and More’s Greatest Hits First Month Combinatorics, Mathematics, Academics, Polemics, … Helly’s Theorem, “Hypertrees”, and Strange Enumeration I (There were 3 follow up posts:) Extremal Combinatorics I: Extremal Problems on Set Systems (There were 4 follow up posts II ; III; IV; VI) Drachmas Rationality, Economics and … Continue reading
The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
A quick schematic roadmap to these new geometric objects. The positroidron can be seen as a cellular structure on the nonnegative Grassmanian – the part of the real Grassmanian G(m,n) which corresponds to m by n matrices with all m by … Continue reading
When Do a Few Colors Suffice?
When can we properly color the vertices of a graph with a few colors? This is a notoriously difficult problem. Things get a little better if we consider simultaneously a graph together with all its induced subgraphs. Recall that an … Continue reading
School Starts at HUJI
We are now starting the third week of the academic year at HUJI. As usual, things are very hectic, a lot of activities in the mathematics department, in our sister CS department, around in the campus, and in our combinatorics … Continue reading
Posted in Updates
Leave a comment
Happy Birthday Ervin, János, Péter, and Zoli!
The four princes in summit 200, ten years ago. (Left to right) Ervin Győri, Zoltán Füredi, Péter Frankl and János Pach In 2014, Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach are turning 60 and summit 240 is a conference … Continue reading
Posted in Conferences, Happy birthday
3 Comments
Happy Birthday Richard Stanley!
This week we are celebrating in Cambridge MA , and elsewhere in the world, Richard Stanley’s birthday. For the last forty years, Richard has been one of the very few leading mathematicians in the area of combinatorics, and he found deep, profound, and … Continue reading
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
Analysis of Boolean Functions week 5 and 6
Lecture 7 First passage percolation 1) Models of percolation. We talked about percolation introduced by Broadbent and Hammersley in 1957. The basic model is a model of random subgraphs of a grid in ndimensional space. (Other graphs were considered later as … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching
Tagged Arrow's theorem, Percolation
Leave a comment
Analysis of Boolean Functions – Week 3
Lecture 4 In the third week we moved directly to the course’s “punchline” – the use of FourierWalsh expansion of Boolean functions and the use of Hypercontractivity. Before that we started with a very nice discrete isoperimetric question on a … Continue reading