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
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
DMV Tagung 2011 - <strong>Köln</strong>, 19. - 22. September<br />
Karim Adiprasito<br />
Freie <strong>Universität</strong> Berlin<br />
Inducing Discrete Morse Functions and Collapsibility of Spaces of Bounded Curvature<br />
We present a new way to induce a Morse matching given a polyhedral complex and a real function on it.<br />
This procedure comes with a natural formula for critical points, and implies strong collapsibility results for<br />
spaces of curvature bounded above.<br />
(Joint work with Bruno Benedetti.)<br />
Maria Hernandez Cifre<br />
<strong>Universität</strong> Murcia<br />
Coverings and compressed lattices<br />
Pavle V. M. Blagojević<br />
Freie <strong>Universität</strong> Berlin<br />
On the Trail of Topological Tverberg Conjecture<br />
The topological Tverberg conjecture, posed by Bárány, Shlosman and Szücs in 1981, still open in the<br />
case of non prime powers, is one of the most challenging and resistent open problems in the Geometric<br />
Combinatorics. In this talk, seeking the proof of the topological Tverberg conjecture, we reveal hidden<br />
ideas and open problems standing behind recent results of Blagojević, Matschke and Ziegler.<br />
Hartwig Bosse<br />
Goethe-<strong>Universität</strong> Frankfurt am Main<br />
t.b.a.<br />
René Brandenberg<br />
Technische <strong>Universität</strong> München<br />
k-Center, Core-Sets, and Successive Radii – Dimension Reduction in Computational Discrete<br />
Geometry<br />
In recent years new techniques in solving euclidean k-center problems were obtained. We present some<br />
positive and negative results for the general problem. The latter using some new geometric inequalities<br />
in the line of Jung’s theorem.<br />
139