Recent Comments
-
Recent Posts
- Algorithmic Game Theory: Past, Present, and Future
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Igor Pak: How I chose Enumerative Combinatorics
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Noga Alon and Udi Hrushovski won the 2022 Shaw Prize
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Past and Future Events
- Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
Top Posts & Pages
- Algorithmic Game Theory: Past, Present, and Future
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- The Argument Against Quantum Computers - A Very Short Introduction
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Combinatorics, Mathematics, Academics, Polemics, ...
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- TYI 30: Expected number of Dice throws
- Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectation-thresholds
RSS
Monthly Archives: November 2016
Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash’s Theorem. And more news on designs.
Blogging was slow recently, and I have various half written posts on all sort of interesting things, and plenty of unfulfilled promises. I want to quickly share with you two and a half news items regarding combinatorial designs. As you … Continue reading