Winter Term 2013/2014
Welcome to the course website! The lectures on Discrete Geometry I are taught by Günter M. Ziegler. The tutorial is held by Albert Haase. If you have any questions, please ask us during class or email us!
Course Description
This is the first in a series of three courses on Discrete Geometry. We will get to know fascinating geometric structures such as configurations of points and lines, hyperplane arrangements, and in particular polytopes and polyhedra, and learn how to handle them using modern methods for computation and visualization and current analysis and proof techniques. A lot of this looks quite simple and concrete at first sight (and some of it is), but it also very quickly touches topics of current research.
For students with an interest in discrete mathematics and geometry, this is the starting point to specialize in discrete geometry. The topics addressed in the course supplement and deepen the understanding of discrete-geometric structures appearing in differential geometry, optimization, combinatorics, topology, and algebraic geometry. To follow the course, a solid background in linear algebra is necessary. Some knowledge of combinatorics and geometry is helpful.
- Polyhedra and polyhedral complexes
- Configurations of points, hyperplanes, subspaces
- Subdivisions and triangulations (including Delaunay and Voronoi)
- Examples and Problems
- Arrangements of points and lines: Sylvester-Gallai, Erdös-Szekeres,
- Szemeredi--Trotter
- Arrangements, zonotopes, zonotopal tilings, oriented matroids
- Examples and Problems (Challenge problem: simplicial line arrangements)
- Representations and the theorem of Minkowski-Weyl
- Polarity, simple/simplicial polytopes
- Shellability, face lattices, f-vectors, Euler- and Dehn-Sommerville
- Graphs, diameters, and the Hirsch (ex-)conjecture
- regular polytopes, centrally symmetric polytopes
- extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
- combinatorial optimization and 0/1-Polytope
- Linear programs, simplex algorithm, LP-duality
Lectures
Lecture | ||
TUE | 10:15 - 11:45 | Arnimallee 6 Room 007/008 |
WED | 10:15 - 11:45 | Arnimallee 6 Room 007/008 |
Contact
Office Hours: | |||
Lecture | Prof. Günter M. Ziegler | ziegler(at)math.fu-berlin.de | TBA |
Tutorial | Albert Haase | a.haase(at)fu-berlin.de | TBA |
Tutorial and Exercises
Tutorial | ||
WED | 14:15 - 16:15 | Arnimallee 6, Room 031 |
In addition to the lectures there will be a weekly tutorial. In the tutorial, we will occasionally review topics from the lectures but mostly discuss examples and solve exercises. Each week every student is asked to solve a set of three or four exercises that will appear on this website in form of an exercise sheet. The exercise sheets will be uploaded on Wednesdays and solutions should be turned in before the second lecture in the following week. Please bring them with you to the lecture on Wednesday and hand them to Professor Ziegler by 10:15 AM. You will receive points for solving each exercise based on whether your solution is correct and well-written.
Course requirements are the following: (1) You must score at least 60% of the sum of the maximum number of points on all exercises. In other words, it is ok to score less than 60% on an exercise sheet as long as you reach 60% of the total points by the end of the semester. (2) You must pass an exam at the end of the semester for which which will determine the grade you will receive for this course. Details about the nature of the exam will be discussed as we go along.