- Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
- Happy Birthday Ervin, János, Péter, and Zoli!
- My Mathematical Dialogue with Jürgen Eckhoff
- Test Your Intuition (23): How Many Women?
- Happy Birthday Richard Stanley!
- Influence, Threshold, and Noise
- Erdős Lectures 2014 – Dan Spielman
- Answer to Test Your Intuition (22)
- Test your intuition (22): Selling Two Items in a Bundle.
Top Posts & Pages
- Why Quantum Computers Cannot Work: The Movie!
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Polymath 8 - a Success!
- Believing that the Earth is Round When it Matters
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Another Forgotten Bet: Is Don Zagier About to Owe Me 1000 Shekels For The Proof of the ABC Conjecture?
- 'Gina Says'
- In how many ways you can chose a committee of three students from a class of ten students?
Tag Archives: Peter Keevash
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