Recent Comments
-
Recent Posts
- Some News from a Seminar in Cambridge
- Subspace Designs, Unit and Distinct Distances, and Piercing Standard Boxes.
- Greg Kuperberg @ Tel Aviv University
- Israel AGT Day, Reichman University, March 5, 2023
- Alef’s Corner: Democracy (Israel, 2023)
- Absolutely Sensational Morning News – Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
Top Posts & Pages
- Some News from a Seminar in Cambridge
- Absolutely Sensational Morning News - Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- Greg Kuperberg @ Tel Aviv University
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth's theorem!
- 'Gina Says'
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- R(5,5) ≤ 48
- The Argument Against Quantum Computers - A Very Short Introduction
RSS
Monthly Archives: March 2017
My Answer to TYI- 28
The fifteen remarkable individuals in the previous post are all the recipients of the SIGACT Distinguished Service Prize since it was established in 1997. The most striking common feature to all of them is, in my view, that they are all … Continue reading
Posted in Computer Science and Optimization, Women in science
Tagged SIGACT, Women in science
2 Comments
Test your intuition 28: What is the most striking common feature to all these remarkable individuals
Test your intuition: What is the most striking common feature to all these fifteen remarkable individuals László Babai; Avi Wigderson; Lance Fortnow; Lane Hemaspaandra; Sampath Kannan; Hal Gabow; Richard Karp; Tom Leighton; Rockford J. Ross; Alan Selman; Michael Langston; S. … Continue reading
R(5,5) ≤ 48
The Ramsey numbers R(s,t) The Ramsey number R(s, t) is defined to be the smallest n such that every graph of order n contains either a clique of s vertices or an independent set of t vertices. Understanding the values … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Brendan D. McKay, Vigleik Angeltveit
1 Comment
Test Your Intuition (27) about the Alon-Tarsi Conjecture
On the occasion of Polymath 12 devoted to the Rota basis conjecture let me remind you about the Alon-Tarsi conjecture and test your intuition concerning a strong form of the conjecture. The sign of a Latin square is the product … Continue reading
Posted in Combinatorics, Open problems, Test your intuition
Tagged Alon-Tarsi conjecture, Polymath12
1 Comment