Recent Comments

Recent Posts
 Hoi Nguyen and Melanie Wood: Remarkable Formulas for the Probability that Projections of Lattices are Surjective
 Petra! Jordan!
 The largest clique in the Paley Graph: unexpected significant progress and surprising connections.
 Thinking about the people of Wuhan and China
 Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
 Test your intuition 43: Distribution According to Areas in Top Departments.
 Two talks at HUJI: on the “infamous lower tail” and TOMORROW on recent advances in combinatorics
 Amazing: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen proved that MIP* = RE and thus disproved Connes 1976 Embedding Conjecture, and provided a negative answer to Tsirelson’s problem.
 Do Not Miss: Abel in Jerusalem, Sunday, January 12, 2020
Top Posts & Pages
 Hoi Nguyen and Melanie Wood: Remarkable Formulas for the Probability that Projections of Lattices are Surjective
 Aubrey de Grey: The chromatic number of the plane is at least 5
 Konstantin Tikhomirov: The Probability that a Bernoulli Matrix is Singular
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Coloring Problems for Arrangements of Circles (and Pseudocircles)
 Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectationthresholds
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
1 Comment
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