Recent Comments

Recent Posts
 Open problem session of HUJICOMBSEM: Problem #1, Nati Linial – Turan type theorems for simplicial complexes.
 Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
 To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal’s odd cycle problem
 To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
 Benjamini and Mossel’s 2000 Account: Sensitivity of Voting Schemes to Mistakes and Manipulations
 Test Your Intuition (46): What is the Reason for Maine’s Huge Influence?
 This question from Tim Gowers will certainly cheeer you up! and test your intuition as well!
 Three games to cheer you up.
 Cheerful Test Your Intuition (#45): Survey About Sisters and Brothers
Top Posts & Pages
 Open problem session of HUJICOMBSEM: Problem #1, Nati Linial  Turan type theorems for simplicial complexes.
 Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
 To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal's odd cycle problem
 TYI 30: Expected number of Dice throws
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 This question from Tim Gowers will certainly cheeer you up! and test your intuition as well!
 Cheerful Test Your Intuition (#45): Survey About Sisters and Brothers
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
RSS
Tag Archives: Peter Keevash
Exciting BeginningoftheYear Activities and Seminars.
Let me mention two talks with very promising news by friends of the blog, Karim Adiprasito and Noam Lifshitz. As always, with the beginning of the academic year there are a lot of exciting activities, things are rather hectic around, … Continue reading
Posted in Combinatorics, Geometry, Probability
Tagged Dor Minzer, Eoin Long, Karim Adiprasito, Noam Lifshitz, Peter Keevash
3 Comments
Peter Keevash and Eoin Long: Forbidden vectorvalued intersections
Peter Keevash and Eoin Long arxived some time ago a very nice paper: Forbidden vectorvalued intersections, which settled a problem that was first posed here on the blog. Here is the abstract. We solve a generalised form of a conjecture of Kalai … Continue reading
Peter Keevash: More and Easier Designs!
Peter Keevash just posted on the arxiv a couple of new papers on designs. The first is a rewritten version of his original paper The existence of designs with a much simpler proof. The second paper The existence of designs … Continue reading
Séminaire N. Bourbaki – Designs Exist (after Peter Keevash) – the paper
Update: Nov 4, 2015: Here is the final version of the paper: Design exists (after P. Keevash). On June I gave a lecture on Bourbaki’s seminare devoted to Keevash’s breakthrough result on the existence of designs. Here is a draft of the … Continue reading
In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 1831
The 18th yearly school in mathematics is devoted this year to combinatorics. It will feature lecture series by Irit Dinur, Joel Hass, Peter Keevash, Alexandru Nica, Alexander Postnikov, Wojciech Samotij, and David Streurer and additional activities. As usual grants … 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
Posted in Combinatorics, Open problems
Tagged Combinatorics, Designs, Oberwolfach, Peter Keevash
16 Comments