05.12.2012 Views

Inhaltsverzeichnis - Mathematisches Institut der Universität zu Köln

Inhaltsverzeichnis - Mathematisches Institut der Universität zu Köln

Inhaltsverzeichnis - Mathematisches Institut der Universität zu Köln

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Jonathan Spreer<br />

<strong>Universität</strong> Stuttgart<br />

Slicings of Combinatorial 3-Manifolds<br />

DMV Tagung 2011 - <strong>Köln</strong>, 19. - 22. September<br />

We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds.<br />

Focus is given to the case of dimension 3, where slicings are (discrete) normal surfaces. The talk will be<br />

about three particular questions:<br />

1. Is there a connection between the number of quadrilaterals of a slicing and its genus?<br />

2. Which weakly neighborly polyhedral maps can be embedded into combinatorial 3-manifolds?<br />

3. How can we use slicings to construct combinatorial 3-manifolds with a transitive automorphism group?<br />

Gennadiy Averkov<br />

Otto-von-Guericke-<strong>Universität</strong> Magdeburg<br />

Compact Polynomial Representations of Special Semialgebraic Sets<br />

Bosse, Grötschel and Henk conjectured that every d-dimensional polytope in R d can be determined by<br />

a system of d nonstrict polynomial inequalities. Recently this conjecture has been confirmed in a joint<br />

work with Ludwig Bröcker. We also present further results on compact polynomial descriptions of special<br />

classes of semialgebraic sets.<br />

Christian Wagner<br />

Eidgenössische Technische Hochschule Zürich<br />

Maximal Lattice-Free Polyhedra in Mixed-Integer Cutting Plane Theory<br />

A polyhedron with non-empty interior is maximal lattice-free if it is inclusion-maximal with respect to the<br />

property of not containing integer points in its interior. In this talk, I will explain the relation between<br />

maximal lattice-free polyhedra and cutting plane generation in mixed-integer linear optimization.<br />

Günter M. Ziegler<br />

Freie <strong>Universität</strong> Berlin<br />

Polytopes with Few Degrees of Freedom<br />

143

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!