Friday, April 28 2017, 2:15pm
Mathematical optimization for extremal discrete geometry
Frank Vallentin (Universität zu Köln)
How densely can one pack given objects into a given container? Such packing problems are fundamental problems in discrete geometry. Next to being classical mathematical challenges there are many applications in diverse areas such as information theory, materials science, physics, logistics, approximation theory.
Studying packing problems one is facing two basic tasks: Constructions: How to construct packings which are conjecturally optimal? Obstructions: How to prove that a given packing is indeed optimal? In the talk I want to explain computational tools for both tasks. I will report on computational results, which are frequently the best-known.
Ort: Raum 008/SeMath, Pontdriesch 14-16, 52062 Aachen