19061
Lecture
SoSe 13: (V) BasisM Diskrete Geometrie II
Raman Sanyal
Information for students
Zielgruppe:
The target audience are students with an interest in discrete mathematics and (convex) geometry. The course is a good entry point for a specialization in discrete geometry. The topics addressed in the course supplement and deepen the understanding for discrete-geometric structures appearing in differential geometry, topology, combinatorics, and algebraic geometry.
close
Additional information / Pre-requisites
Solid background in linear algebra and some analysis. Basic knowledge and experience with polytopes and/or convexity will be helpful.
Comments
Inhalt:
This is the second in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures with an emphasis on convex geometric properties. In the course we will develop central themes in discrete and convex geometry including proof techniques and applications to other areas in mathematics.
The material will be a selection of the following topics:
Basic structures in discrete and convex geometry
- convexity and separation theorems
- convex bodies and polytopes/polyhedra
- faces and boundary structures
- polarity
- approximation by polytopes
- subdivisions and triangulations (including Delaunay and Voronoii)
Notions and tools
- face numbers and invariants
- volumes and mixed volumes
- volume computations and estimates
- Löwner-John ellipsoids and roundness
- valuations
Geometric inequalities
- Brunn-Minkowski and Alexsandrov-Fenchel inequality
- isoperimetric inequalities
- measure concentration and phenomena in high-dimensions
- Minkowski's representation theorem for polytopes
Geometry of numbers
- lattices
- Minkowski's (first) theorem
- successive minima
- lattice points in convex bodies and Ehrhart's theorem
- Ehrhart-Macdonald reciprocity
Sphere packings
- lattice packings and coverings
- Theorem of Minkowski-Hlawka
- analytic methods
Applications in optimization, number theory, algebra, algebraic geometry, and functional analysis
close
Basic structures in discrete and convex geometry
- convexity and separation theorems
- convex bodies and polytopes/polyhedra
- faces and boundary structures
- polarity
- approximation by polytopes
- subdivisions and triangulations (including Delaunay and Voronoii) Notions and tools
- face numbers and invariants
- volumes and mixed volumes
- volume computations and estimates
- Löwner-John ellipsoids and roundness
- valuations Geometric inequalities
- Brunn-Minkowski and Alexsandrov-Fenchel inequality
- isoperimetric inequalities
- measure concentration and phenomena in high-dimensions
- Minkowski's representation theorem for polytopes Geometry of numbers
- lattices
- Minkowski's (first) theorem
- successive minima
- lattice points in convex bodies and Ehrhart's theorem
- Ehrhart-Macdonald reciprocity Sphere packings
- lattice packings and coverings
- Theorem of Minkowski-Hlawka
- analytic methods
Suggested reading
* G.M. Ziegler "Lectures on Polytopes" * R. Schneider "Convex Bodies: The Brunn-Minkowski Theory" * P. Gruber "Convex and Discrete Geometry" * J. Matousek "Lectures on Discrete Geometry" More literature will be announced in class.
close26 Class schedule
Regular appointments
Tue, 2013-04-09 10:00 - 12:00
Tue, 2013-04-16 10:00 - 12:00
Tue, 2013-04-23 10:00 - 12:00
Tue, 2013-04-30 10:00 - 12:00
Tue, 2013-05-07 10:00 - 12:00
Tue, 2013-05-14 10:00 - 12:00
Tue, 2013-05-21 10:00 - 12:00
Tue, 2013-05-28 10:00 - 12:00
Tue, 2013-06-04 10:00 - 12:00
Tue, 2013-06-11 10:00 - 12:00
Tue, 2013-06-18 10:00 - 12:00
Tue, 2013-06-25 10:00 - 12:00
Tue, 2013-07-02 10:00 - 12:00
Tue, 2013-07-09 10:00 - 12:00
Thu, 2013-04-18 12:00 - 14:00
Thu, 2013-04-25 12:00 - 14:00
Thu, 2013-05-02 12:00 - 14:00
Thu, 2013-05-16 12:00 - 14:00
Thu, 2013-05-23 12:00 - 14:00
Thu, 2013-05-30 12:00 - 14:00
Thu, 2013-06-06 12:00 - 14:00
Thu, 2013-06-13 12:00 - 14:00
Thu, 2013-06-20 12:00 - 14:00
Thu, 2013-06-27 12:00 - 14:00
Thu, 2013-07-04 12:00 - 14:00
Thu, 2013-07-11 12:00 - 14:00
Inhalt:
This is the second in a series of three courses on discrete geometry. The aim of the course is a skillful handling of discrete geometric structures with an emphasis on convex ...
read more