Recent Comments

Recent Posts
 The Logarithmic Minkowski Problem
 Face to face talks and recorded videotaped introductions
 Alef’s Corner: QED (two versions)
 Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part II, The Classics)
 Giving a talk at Eli and Ricky’s geometry seminar. (October 19, 2021)
 To cheer you up in difficult times 32, Annika Heckel’s guest post: How does the Chromatic Number of a Random Graph Vary?
 To Cheer You Up in Difficult Times 31: Federico Ardila’s Four Axioms for Cultivating Diversity
 Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part I, mainly 2019)
 To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
Top Posts & Pages
 The Logarithmic Minkowski Problem
 To Cheer You Up in Difficult Times 31: Federico Ardila's Four Axioms for Cultivating Diversity
 To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
 To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
 Amazing: Feng Pan and Pan Zhang Announced a Way to "Spoof" (Classically Simulate) the Google's Quantum Supremacy Circuit!
 Greatest Hits
 The Argument Against Quantum Computers  A Very Short Introduction
 Test Your Intuition (17): What does it Take to Win TicTacToe
 NavierStokes Fluid Computers
RSS
Tag Archives: Polymath11
Frankl’s Conjecture for Large Families: Ilan Karpas’ Proof
Frankl’s conjecture asserts that a for every finite family of of finite sets that is closed under union, there is an element that belongs to at least half the sets in the family. We mentioned the problem in our very … Continue reading