Recent Comments
-
Recent Posts
- My Notices AMS Paper on Quantum Computers – Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Updates from Cambridge
- Random Circuit Sampling: Fourier Expansion and Statistics
- Plans and Updates: Complementary Pictures
- Updates and Plans IV
- Three Remarkable Quantum Events at the Simons Institute for the Theory of Computing in Berkeley
- Yair Shenfeld and Ramon van Handel Settled (for polytopes) the Equality Cases For The Alexandrov-Fenchel Inequalities
- On the Limit of the Linear Programming Bound for Codes and Packing
Top Posts & Pages
- My Notices AMS Paper on Quantum Computers - Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Navier-Stokes Fluid Computers
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Updates and plans III.
- To cheer you up in difficult times 23: the original hand-written slides of Terry Tao's 2015 Einstein Lecture in Jerusalem
- Taking balls away: Oz' Version
- TYI 30: Expected number of Dice throws
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Can Category Theory Serve as the Foundation of Mathematics?
RSS
Tag Archives: Peter Keevash
Subspace Designs, Unit and Distinct Distances, and Piercing Standard Boxes.
A lot of things are happening and let me briefly report on three major advancements in combinatorics. Peter Keevash, Ashwin Sah and Mehtaab Sawhney proved the existence of subspace designs with any given parameters, provided that the dimension of the … Continue reading
Posted in Combinatorics, Geometry
Tagged Ashwin Sah, István Tomon, Lisa Sauermann, Matija Bucić, Mehtaab Sawhney, Noga Alon, Peter Keevash
4 Comments
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 Alef's corner, Dor Minzer, Eoin Long, Karim Adiprasito, Noam Lifshitz, Peter Keevash
3 Comments
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
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 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
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 Combinatorics, Designs, Oberwolfach, Peter Keevash
16 Comments