Recent Comments

Recent Posts
 Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
 ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
 Test your intuition 47: AGCGTCTGCGTCTGCGACGATC? what comes next in the sequence?
 Cheerful news in difficult times: Richard Stanley wins the Steele Prize for lifetime achievement!
 Combinatorial Theory is Born
 To cheer you up in difficult times 34: Ringel Circle Problem solved by James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak
 Good Codes papers are on the arXiv
 To cheer you up in difficult times 33: Deep learning leads to progress in knot theory and on the conjecture that KazhdanLusztig polynomials are combinatorial.
 The Logarithmic Minkowski Problem
Top Posts & Pages
 The Argument Against Quantum Computers  A Very Short Introduction
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Reflections: On the Occasion of Ron Adin's and Yuval Roichman's Birthdays, and FPSAC 2021
 TYI 30: Expected number of Dice throws
 The Intermediate Value Theorem Applied to Football
 Zur Luria on the nQueens Problem
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Amazing: Karim Adiprasito proved the gconjecture for spheres!
 To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
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