Recent Comments
Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Matching in NC and L… on Open problem session of HUJI-C… Matching in NC and L… on After-Dinner Speech for Alex… -
Recent Posts
- Matching in NC and Local Events
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
- Three Interviews
- Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
- Polymath Plus AI
- Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”
- Scott Aaronson’s View of my View About Quantum Computing
- The Fully Depolarizing Noise Conjecture for Physical Cat States is Twenty Years Old!
- Cosmin Pohoata: The Cayley-Bacharach theorem and its applications
Top Posts & Pages
- Amazing: Erdős' Unit Distance Problem was Disproved! It was achieved by AI!
- Matching in NC and Local Events
- Attila Por's Universality Result for Tverberg Partitions
- A Proof by Induction with a Difficulty
- Amir Ban on Deep Junior
- TYI 30: Expected number of Dice throws
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Kazhdan Seminar Spring 2026: Boolean Functions, Hypercontractivity, and Applications
- Polymath Plus AI
RSS
Monthly Archives: August 2011
Alantha Newman and Alexandar Nikolov Disprove Beck’s 3-Permutations Conjecture
Alantha Newman and Alexandar Nikolov disproved a few months ago one of the most famous and frustrating open problem in discrepancy theory: Beck’s 3-permutations conjecture. Their paper A counterexample to Beck’s conjecture on the discrepancy of three permutations is already on … Continue reading
Discrepancy, The Beck-Fiala Theorem, and the Answer to “Test Your Intuition (14)”
The Question Suppose that you want to send a message so that it will reach all vertices of the discrete -dimensional cube. At each time unit (or round) you can send the message to one vertex. When a vertex gets the … Continue reading
Test Your Intuition (14): A Discrete Transmission Problem
Recall that the -dimensional discrete cube is the set of all binary vectors ( vectors) of length n. We say that two binary vectors are adjacent if they differ in precisely one coordinate. (In other words, their Hamming distance is 1.) This … Continue reading