Mon premier blog

Lectures on polytopes Ziegler G.M.
Publisher: Springer

Our results include a demonstration that highly unrelated trees can be co-optimal in BME reconstruction, and that NJ regions Ziegler GM: Lectures on polytopes, Graduate Texts in Mathematics. Springer-Verlag, New York; 1995. Clemens Puppe – “Majoritarian Indeterminacy and Path-Dependence: The Condorcet Efficient Set” (based on joint work with Klaus Nehring and Markus Pivato) 2. Uncertainty, Ambiguity and Choice (Organiser Matthew Ryan). Schrijver A: Theory of Linear and Integer Programming. My Convex Regular Polytopes presentation, this time at the Worldwide Center of Mathematics (with video!) December It's under the Research tab, in the Worldwide Research Lectures: just scroll down to my name. Some comments on the f-vectors of polytopes. (Upper bound theorem.) Given a dimension d and a number of vertices n, what is the greatest number f_k of k-faces (or the greatest h_k ) that a polytope can have? This requires the measurement of volumes of spherical polytopes in high dimension, which we obtain using a combination of Monte Carlo methods and polyhedral algorithms. The Centre for Mathematical Social Science at The University of Auckland (New Zealand) is planning a series of lectures and seminars given by visitors and members of the Centre in the games by polytopes.