Recent Comments
-
Recent Posts
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
- And the Oscar goes to: Meir Feder, Zvi Reznic, Guy Dorman, and Ron Yogev
- Thomas Vidick: What it is that we do
- To cheer you up in difficult times 20: Ben Green presents super-polynomial lower bounds for off-diagonal van der Waerden numbers W(3,k)
- To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger corner-free sets from better numbers-on-the-forehead protocols
- Possible future Polymath projects (2009, 2021)
Top Posts & Pages
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- The Argument Against Quantum Computers - A Very Short Introduction
- Possible future Polymath projects (2009, 2021)
- 8866128975287528³+(-8778405442862239)³+(-2736111468807040)³
- TYI 30: Expected number of Dice throws
- Photonic Huge Quantum Advantage ???
- Jean
- ICM 2018 Rio (3) - Coifman, Goldstein, Kronheimer and Mrowka, and the Four Color Theorem
- Dan Romik on the Riemann zeta function
RSS
Monthly Archives: May 2010
Test Your Intuition (12): Perturbing a Polytope
Let P be a d-dimensional convex polytope. Can we always perturb the vertices of P moving them to points with rational coordinates without changing the combinatorial structure of P? In order words, you require that a set of vertices whose … Continue reading
Posted in Convex polytopes, Test your intuition
Tagged Convex polytopes, Test your intuition
4 Comments
Francisco Santos Disproves the Hirsch Conjecture
A title and an abstract for the conference “100 Years in Seattle: the mathematics of Klee and Grünbaum” drew a special attention: Title: “A counter-example to the Hirsch conjecture” Author: Francisco Santos, Universidad de Cantabria Abstract: I have been in … Continue reading
Posted in Convex polytopes, Open problems, Polymath3
36 Comments
Drunken Time and Drunken Computation
The problem We are used to computer programs or models for computations that perform at time step , . Suppose that time is drunk, so instead of running these steps in their correct order, we apply at time step , where … Continue reading
Posted in Computer Science and Optimization
10 Comments