Challenges in Discrete Geometry - Part I: Convex polytopes скачать в хорошем качестве

Challenges in Discrete Geometry - Part I: Convex polytopes

Gil Kalai, The Hebrew University of Jerusalem Workshop on Real Algebraic Geometry and Algorithms for Geometric Constraint Systems http://www.fields.utoronto.ca/activit... Coxeter Lecture Series: Gil Kalai http://www.fields.utoronto.ca/activit... Date and Time: Monday, June 14, 2021 - 9:00am to 10:00am Abstract: Convex polytopes have attracted human attention since ancient times. Euler's formula, V-E+F=2, for the numbers of vertices, edges, and faces F of a 3-dimensional polytope, is among the most important landmarks of mathematics, and it is a starting point for a rich theory of face numbers of polytopes in high dimensions. Another important landmark is Cauchy's rigidity theorem. In the lecture I will present a few major combinatorial results about polytopes, some connections to other areas of mathematics, pure and applied, and fascinating open problems.