Tag Archives: David Walkup

Satoshi Murai and Eran Nevo proved the Generalized Lower Bound Conjecture.

Posted on March 23, 2012 by Gil Kalai

Satoshi Murai and Eran Nevo have just proved the 1971 generalized lower bound conjecture of McMullen and Walkup, in their paper On the generalized lower bound conjecture for polytopes and spheres . Let me tell you a little about it. … Continue reading →

Posted in Convex polytopes, Open problems | Tagged David Walkup, Eran Nevo, Generalized lower bound conjecture, Peter McMullen, Satoshi Murai | 2 Comments

	Jon Awbrey on Influence, Threshold, and…
	Combinatorics and Mo… on Four Derandomization Problems
	Combinatorics and Mo… on Extremal Combinatorics VI: The…
	Gil Kalai on The Simplex, the Cyclic polyto…
	Ada the Amplifier \|… on Quantum computing: achievable…
	From Oberwolfach: Th… on Seven Problems Around Tverberg…
	20 years in quantum… on Quantum computing: achievable…
	Midrasha Mathematica… on Amazing: Peter Keevash Constru…
	Gil Kalai on Quantum computing: achievable…
	Alexander Vlasov on Quantum computing: achievable…
	vznvzn on Quantum computing: achievable…
	Gil Kalai on Quantum computing: achievable…

Tag Archives: David Walkup

Satoshi Murai and Eran Nevo proved the Generalized Lower Bound Conjecture.

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives

Follow “Combinatorics and more”