Recent Comments

Recent Posts
 TYI 41: How many steps does it take for a simple random walk on the discrete cube to reach the uniform distribution?
 Gil’s Collegial Quantum Supremacy Skepticism FAQ
 Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectationthresholds
 Starting today: Kazhdan Sunday seminar: “Computation, quantumness, symplectic geometry, and information”
 The story of Poincaré and his friend the baker
 Gérard Cornuéjols’s baker’s eighteen 5000 dollars conjectures
 Noisy quantum circuits: how do we know that we have robust experimental outcomes at all? (And do we care?)
 Test Your Intuition 40: What Are We Celebrating on Sept, 28, 2019? (And answer to TYI39.)
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
Top Posts & Pages
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 TYI 41: How many steps does it take for a simple random walk on the discrete cube to reach the uniform distribution?
 TYI 30: Expected number of Dice throws
 Lior, Aryeh, and Michael
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
 Amazing: Hao Huang Proved the Sensitivity Conjecture!
 Jeff Kahn and Jinyoung Park: Maximal independent sets and a new isoperimetric inequality for the Hamming cube.
 Aubrey de Grey: The chromatic number of the plane is at least 5
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