Recent Comments
-
Recent Posts
- Call for nominations for the Ostrowski Prize 2017
- Problems for Imre Bárány’s Birthday!
- Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
- Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
- Updates (belated) Between New Haven, Jerusalem, and Tel-Aviv
- Oded Goldreich Fest
- The Race to Quantum Technologies and Quantum Computers (Useful Links)
- Around the Garsia-Stanley’s Partitioning Conjecture
- My Answer to TYI- 28
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Updates and plans III.
- Can Category Theory Serve as the Foundation of Mathematics?
- Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.
- 'Gina Says'
- Five Open Problems Regarding Convex Polytopes
- Sarkaria's Proof of Tverberg's Theorem 2
- Sarkaria's Proof of Tverberg's Theorem 1
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