Recent Comments

Recent Posts
 Mathematical news to cheer you up
 To Cheer You Up in Difficult Times 28: Math On the Beach (Alef’s Corner)
 To cheer you up in difficult times 27: A major recent “Lean” proof verification
 To cheer you up in difficult times 26: Two reallife lectures yesterday at the Technion
 To Cheer You Up in Difficult times 24: Borodin’s colouring conjecture!
 To cheer you up in difficult times 25: some mathematical news! (Part 2)
 To cheer you up in difficult times 23: the original handwritten slides of Terry Tao’s 2015 Einstein Lecture in Jerusalem
 Alef Corner: ICM2022
 The probabilistic proof that 2^400593 is a prime: a revolutionary new type of mathematical proof, or not a proof at all?
Top Posts & Pages
 Mathematical news to cheer you up
 The Argument Against Quantum Computers  A Very Short Introduction
 A sensation in the morning news  Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
 To cheer you up in difficult times 27: A major recent "Lean" proof verification
 Zur Luria on the nQueens Problem
 To Cheer You Up in Difficult Times 28: Math On the Beach (Alef's Corner)
 The Quantum FaultTolerance Debate Updates
 Around Borsuk’s Conjecture 3: How to Save Borsuk's conjecture
 To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
RSS
Monthly Archives: January 2011
IPAM remote blogging: The Many Facets of Linear Programming
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
Günter Ziegler: 1000$ from Beverly Hills for a Math Problem. (IPAM remote blogging.)
Scanned letter by Zadeh. (c) Günter M. Ziegler lefttoright: 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
Posted in Computer Science and Optimization, Conferences, Guest blogger
Tagged Linear programming
4 Comments
IPAM Remote Blogging: SantosWeibel 25Vertices Prismatoid and Prismatoids with large Width
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 5prismatoids” A prismatoid is a polytope … Continue reading
Remote Blogging: Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?
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
Is Backgammon in P?
The Complexity of ZeroSum 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
To Life, to Science and to Innovations
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