Tag Archives: Convexity

Igor Pak’s “Lectures on Discrete and Polyhedral Geometry”

Posted on August 27, 2009 by Gil Kalai

Here is a link to Igor Pak’s book on Discrete and Polyhedral Geometry (free download) . And here is just the table of contents. It is a wonderful book, full of gems, contains original look on many important directions, things that … Continue reading →

Posted in Book review, Convex polytopes, Convexity | Tagged Convex polytopes, Convexity, Igor Pak, rigidity | 4 Comments

Five Open Problems Regarding Convex Polytopes

Posted on May 7, 2008 by Gil Kalai

The problems 1. The conjecture A centrally symmetric d-polytope has at least non empty faces. 2. The cube-simplex conjecture For every k there is f(k) so that every d-polytope with has a k-dimensional face which is either a simplex … Continue reading →

Posted in Combinatorics, Convex polytopes, Convexity, Open problems | Tagged Combinatorics: geometric, Convex polytopes, Convexity, mathematical open problems | 19 Comments

	Gil Kalai on Gil’s Collegial Quantum…
	Louis on Ringel Conjecture, Solved! Con…
	adityaguharoy on Elchanan Mossel’s Amazin…
	sylvainjulien on Hoi Nguyen and Melanie Wood: R…
	Gil Kalai on Hoi Nguyen and Melanie Wood: R…
	shakeddown on Hoi Nguyen and Melanie Wood: R…
	Gil Kalai on Hoi Nguyen and Melanie Wood: R…
	Gil Kalai on Hoi Nguyen and Melanie Wood: R…
	Hoi Neguyen and Mela… on Konstantin Tikhomirov: The Pro…
	Ian Hailes on TYI 30: Expected number of Dic…
	Gil Kalai on The largest clique in the Pale…
	Gil Kalai on The largest clique in the Pale…

Tag Archives: Convexity

Igor Pak’s “Lectures on Discrete and Polyhedral Geometry”

Five Open Problems Regarding Convex Polytopes

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives