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
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Physics Related News: Israel Joining CERN, Pugwash and Global Zero, The Replication Crisis, and MAX the Damon.
- TYI 30: Expected number of Dice throws
- An interview with Noga Alon
- TYI 54: A Variant of Elchanan Mossel’s Amazing Dice Paradox
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Updates from Cambridge
RSS
Tag Archives: Justin Gilmer
Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
Frankl’s conjecture (aka the union closed sets conjecture) asserts that if is a family of subsets of [n] (=: ) which is closed under union then there is an element such that Justin Gilmer just proved an amazing weaker form … Continue reading