- Alef Corner: Math Collaboration
- Alef’s Corner: Math Collaboration 2
- To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
- To cheer you up in difficult times 10: Noam Elkies’ Piano Improvisations and more
- Quantum Matters
- To cheer you up in difficult times 9: Alexey Pokrovskiy proved that Rota’s Basis Conjecture holds asymptotically
- To Cheer you up in Difficult Times 8: Nathan Keller and Ohad Klein Proved Tomaszewski’s Conjecture on Randomly Signed Sums
- Noam Lifshitz: A new hypercontractivity inequality — The proof!
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth’s theorem!
Top Posts & Pages
- TYI 30: Expected number of Dice throws
- Quantum Matters
- Gil's Collegial Quantum Supremacy Skepticism FAQ
- To Cheer you up in Difficult Times 8: Nathan Keller and Ohad Klein Proved Tomaszewski's Conjecture on Randomly Signed Sums
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Extremal Combinatorics IV: Shifting
- Are Natural Mathematical Problems Bad Problems?
Monthly Archives: January 2011
The many facets of Linear Programming Here is an extremely nice paper by Michael Todd from 2001. It gives useful background for many lectures and it can serve as a good base point to examine last decade’s progress. Background post for … Continue reading
Scanned letter by Zadeh. (c) Günter M. Ziegler left-to-right: David Avis, Norman Zadeh, Oliver Friedmann, and Russ Caflish (IPAM director). Photo courtesy Eddie Kim. Update: The slides for Friedmann’s talk are now available. The conference schedule page contains now the slides for … Continue reading
Here is a web page by Christope Weibel on the improved counterexample. The IPAM webpage contains now slides of some of the lectures. Here are Santos’s slides. The last section contains some recent results on the “width of 5-prismatoids” A prismatoid is a polytope … Continue reading
Here are some links and posts related to some of the talks in IPAM’s workshop “Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?” I will be happy to add links to pdf’s of the presentations and to relevant papers. Descriptions and … Continue reading
The Complexity of Zero-Sum Stochastic Games with Perfect Information Is there a polynomial time algorithm for chess? Well, if we consider the complexity of chess in terms of the board size then it is fair to think that the answer is … Continue reading
ICS2011 at ITCS, Tsinghua University, Beijing, China The title of this post “To life, to Science and to Innovations” was Silvio Micali’s toast at the second conference on Innovations in Computer Science and Silvio’s words have a good chance of becomeing the official toast of … Continue reading