...
Bereich | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
|
Info |
---|
The written exam will take place on Wednesday, February the 5th between 10 and 12 AM. We will give you more details about what to expect during the first week of school in January. Happy Holidays from my (Albert's) side. I'm sorry that I can't make the Christmas Tea tomorrow. Enjoy the break and have a happy New Year! P. S. There will be NO official problem sheet during the break, but we might surprise you with mathematical 'Holiday Greetings' - who knows? |
Hinweis |
There was a mistake on Problem Sheet 9. In Problem 1 (iv), the integer k needs to be strictly less than d (and greater 0). A correct version has been uploaded. |
Bereich |
---|
Course DescriptionThis 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
Combinatorial geometry / Geometric combinatorics
Polytope theory
Examples, examples, examples
Geometry of linear programming
|
...