Symplectic Structures in Geometry, Algebra and Dynamics
Collaborative Research Centre TRR 191
A1, A2, A3, A5, A6, A7
B1, B2, B3, B4, B5, B6, B7
C1, C2, C3, C4, C5
Algebra, Combinatorics & Optimization
C2: Algorithmic symplectic packing
Geiges, Jünger, Vallentin
The aim of this project is to develop algorithmic tools for simplex packings that stem from the ball packing problem in symplectic topology. We want to formulate these packing questions as optimization problems so that recent, advanced algorithmic tools from combinatorial optimization (mixed integer non-linear programming, semidefinite optimization) can be used in this context. The insight gained from this experimental work should serve as the basis for further theoretical study. A major challenge, both computationally and theoretically, is the computation of packing widths in dimension greater than four.
Prof. Hansjörg Geiges (PI)
mail: geiges at
phone: 0221 / 470 4345
room: 222/223
Mathematical Institute
University of Cologne
Prof. Michael Jünger (PI)
mail: mjuenger at
phone: 0221 / 470 89780
room: 6.07 (Weyertal 121)
Computer Science Department
University of Cologne
Prof. Frank Vallentin (PI)
mail: frank.vallentin at
phone: 0221 / 470 6003
location: Weyertal 80
Mathematical Institute
University of Cologne
Impressum Institution of DFG, MI University of Cologne and FM Ruhr-University Bochum