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
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Combinatorics, Mathematics, Academics, Polemics, ...
- 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: 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