Versionen im Vergleich

Schlüssel

  • Diese Zeile wurde hinzugefügt.
  • Diese Zeile wurde entfernt.
  • Formatierung wurde geändert.

...

Hinweis

There was a mistake in Problem 1 (a). It has been corrected and turned into a bonus problem on Mon, Dec. 4. We will discuss it in the tutorials on Wednesday. Sorry, if it confused you.

Bereich

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.

We will cover a selection of the following topics:
Basic structures in discrete geometry
  • Polyhedra and polyhedral complexes
  • Configurations of points, hyperplanes, subspaces
  • Subdivisions and triangulations (including Delaunay and Voronoi)
  • Examples and Problems
Combinatorial geometry / Geometric combinatorics
  • 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)
Polytope theory
  • 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
Examples, examples, examples
  • Regular polytopes, centrally symmetric polytopes
  • Extremal polytopes, cyclic/neighborly polytopes, stacked polytopes
  • Combinatorial optimization and 0/1-Polytope
Geometry of linear programming
  • Linear programs, simplex algorithm, LP-duality

...