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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Andreas Paffenholz<br />

Technische <strong>Universität</strong> Darmstadt<br />

Permutation Polytopes<br />

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

A permutation polytope is the convex hull of the permutation matrices of a subgroup of Sn. These polytopes<br />

are a special class of 0/1-polytopes. A well-known example is the Birkhoff polytope of all doubly-stochastic<br />

matrices. This polytope is defined by the full symmetric group Sn. Much less is known for general groups.<br />

I will introduce basic properties of permutation polytopes, characterize faces, and discuss connections<br />

between the group and the polytope. The main focus of my presentation will be on recent results for<br />

permutation polytopes defined by cyclic groups. Their face structure depends on the cycle structure of<br />

the generator, and I will describe exponential families of facets. The class of cyclic permutation polytopes<br />

contains the class of marginal polytopes.<br />

(This is joint work with Barbara Baumeister, Christian Haase, and Benjamin Nill.)<br />

Raman Sanyal<br />

University of California, Berkeley<br />

Deciding Polyhedrality of Spectrahedra<br />

Spectrahedra are to semidefinite programming what polyhedra are to linear programming. Spectrahedra<br />

form a rich class of convex bodies with many of the favorable properties of polyhedra. It is a theoretical<br />

interesting and practically relevant question to decide when a spectrahedron is a polyhedron. In this<br />

talk I will discuss an algorithm for doing that which requires a good un<strong>der</strong>standing of the geometry of<br />

spectrahedra and some linear algebra. Only knowledge of the latter will be assumed.<br />

(This is joint work with Avinash Bhardwaj and Philipp Rostalski.)<br />

Margarita Spirova<br />

Technische <strong>Universität</strong> Chemnitz<br />

Translative Coverings of Convex Bodies<br />

We discuss arrangements of proper translates of a convex body K in R n sufficient to cover this body.<br />

We call such an arrangement a t-covering (a covering by translates) of K. First we investigate relations<br />

between t-coverings of the whole of K and t-coverings of only its boundary. Refining the notion of tcovering<br />

in several ways, we discuss, particularly for centrally symmetric convex bodies and n = 2, how<br />

such coverings relate to the classical theorems of ¸Ti¸teica and Miquel as well as to notions like Voronoi<br />

regions. We also compare t-coverings with coverings in the spirit of Hadwiger, using smaller homothetical<br />

copies of K instead of proper translates. Finally we give upper bounds on the cardinalities of t-coverings.<br />

(The talk is based on a joint work with Marek Lassak and Horst Martini.)<br />

142

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

Saved successfully!

Ooh no, something went wrong!