Recent Comments

Recent Posts
 The Trifference Problem
 Greatest Hits 20152022, Part II
 Greatest Hits 20152022, Part I
 Tel Aviv University Theory Fest is Starting Tomorrow
 Alef’s Corner
 A Nice Example Related to the Frankl Conjecture
 Amazing: Justin Gilmer gave a constant lower bound for the unionclosed sets conjecture
 Barnabás Janzer: Rotation inside convex Kakeya sets
 Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Amazing: Justin Gilmer gave a constant lower bound for the unionclosed sets conjecture
 Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
 Quantum Computers: A Brief Assessment of Progress in the Past Decade
 A Nice Example Related to the Frankl Conjecture
 Amazing: Karim Adiprasito proved the gconjecture for spheres!
 The Trifference Problem
 Aubrey de Grey: The chromatic number of the plane is at least 5
 Sarkaria's Proof of Tverberg's Theorem 1
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 Alef's corner, 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