19216911
Seminar
SoSe 15: EM Forschungsseminar "Seminar zur Diskreten Geometrie"
Raman Sanyal, Arnau Padrol Sureda
Comments
Inhalt:
Extensions of polytopes The extension complexity of a polytope P is the minimal number of facets of a polytope Q that linearly projects onto P. This rather simple definition has interesting consequences and relations to areas such as discrete geometry, combinatorial optimization, information theory, and linear algebra. Determining the extension complexity of a polytope is extremely hard (even for polygons!) and obtaining exact values or even just bounds for special polytopes is an active area of research. The goal of the seminar is to develop a good understanding of extension complexity and the notions related to it. Topics might include- geometry of extensions: sections, projections, and duality
- relations to the nonnegative rank of matrices
- lower bounds via coverings and chromatic numbers
- bounds via communication protocols
- special instances: permutahedra, matching polytopes, etc.
- other notions of extensions: the positive semidefinite and cone ranks
14 Class schedule
Regular appointments
Tue, 2015-04-14 14:00 - 16:00
Tue, 2015-04-21 14:00 - 16:00
Tue, 2015-04-28 14:00 - 16:00
Tue, 2015-05-05 14:00 - 16:00
Tue, 2015-05-12 14:00 - 16:00
Tue, 2015-05-19 14:00 - 16:00
Tue, 2015-05-26 14:00 - 16:00
Tue, 2015-06-02 14:00 - 16:00
Tue, 2015-06-09 14:00 - 16:00
Tue, 2015-06-16 14:00 - 16:00
Tue, 2015-06-23 14:00 - 16:00
Tue, 2015-06-30 14:00 - 16:00
Tue, 2015-07-07 14:00 - 16:00
Tue, 2015-07-14 14:00 - 16:00
Inhalt:
Extensions of polytopes The extension complexity of a polytope P is the minimal number of facets of a polytope Q that linearly projects onto P. This rather simple definition ... read more