Tag Archives: Peter Keevash

Exciting Beginning-of-the-Year 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 , , , , | Leave a comment

Peter Keevash and Eoin Long: Forbidden vector-valued intersections

Peter Keevash and Eoin Long arxived some time ago a very nice paper:  Forbidden vector-valued 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

Posted in Combinatorics | Tagged , | Leave a comment

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

Posted in Combinatorics | Tagged | Leave a comment

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

Posted in Combinatorics | Tagged , | 6 Comments

In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 18-31

  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

Posted in Conferences, Updates | Tagged , , , , , , , | 1 Comment

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 q-subsets from an n-element set X set so that every r-subset of X is included in precisely λ sets in the collection? … Continue reading

Posted in Combinatorics, Open problems | Tagged , , | 15 Comments