Monthly Archives: November 2008

Greg’s Dinosaurs Riddle

Posted on November 7, 2008 by Gil Kalai

The two-riddles post was a success, and while corresponding with Greg Kuperberg he had a riddle for me about dinosaurs, and he agreed I will share it with you. Right before the Chixculub asteroid hit the earth, there were a … Continue reading →

Posted in Riddles | Tagged Dinosaurs, Riddles | 6 Comments

A Diameter Problem (6): Abstract Objective Functions

Posted on November 4, 2008 by Gil Kalai

George Dantzig and Leonid Khachyan In this part we will not progress on the diameter problem that we discussed in the earlier posts but will rather describe a closely related problem for directed graphs associated with ordered families of sets. The role models for … Continue reading →

Posted in Combinatorics, Convex polytopes, Open problems | Tagged Hirsch conjecture, Linear programming | 7 Comments

	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…
	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…

Monthly Archives: November 2008

Greg’s Dinosaurs Riddle

A Diameter Problem (6): Abstract Objective Functions

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives