The aim of the workshop is to bring together senior and especially junior researchers who work on optimization problems in discrete geometry (like for instance sphere packing or energy minimization). The focus will be on computational and experimental mathematical techniques. With short talks and many discussions we want share our computational tools, find their current limitations, and identify exciting problems which might help to shape the field in the near future.
Locations
Hotel: Hotel Flandrischer Hof https://www.flandrischerhof.de
Wednesday: Übungsraum 2, Gyrhofstraße 8, 50931 Köln. https://goo.gl/maps/4NrVrWHMZnKTiBSWA
The entrance of the building ist located on its backside, please use the one on the „long“ side, directly adjacent to the parking lot. Upon entering you use the door on the far left side, after that you will find the room on the far left side.
Thursday/Friday: Room 1.03, RRZK Universität zu Köln, Weyertal 121, 50931 Köln. https://goo.gl/maps/ZtFDeP6MbvDNrKC5A
Public Transport:
We recommend https://www.bahn.de if you want to plan your trip.
Tramstop Sülz Universität, line STR 9 (you can reach this by taking line STR 18 from Cologne central station to Neumarkt, where you can switch to line STR 9. Alternatively, if you arrive at Köln Messe/Deutz you can use line STR 9 directly from there.)
Schedule
Wednesday, November 30
| 11:00-12:00 | Arrival and coffee | |
| 12:00-13:30 | Lunch break | |
| 13:30-14:15 | A new kind of packing and covering | Markus Faulhuber |
| 14:30-15:00 | News approaches to Polarization | Jan Rolfes |
| 15:00-15:30 | Coffee break | |
| 15:30-17:30 | Worksession | |
| 17:30 | Evening program |
Thursday, December 1
| 09:00-09:30 | Coffee | |
| 09:30-10:15 | Optimization hierarchies for distance-avoiding sets | Fernando de Oliveira Filho |
| 10:15-10:45 | Coffee break | |
| 10:45-11:15 | Asymptotic convergence of k-point bounds on compact packing graphs | Bram Bekker |
| 11:30-12:00 | Evaluating the connectivity of a graph using semidefinite programming | Melanie Siebenhofer |
| 12:00-13:30 | Lunch break | |
| 13:30-14:15 | Computing spectral bounds for geometric graphs via polynomial optimization | Philippe Moustrou |
| 14:30-15:00 | New lower bounds on crossing numbers of K_{m,n} from permutation modules and semidefinite programming | Daniel Brosch |
| 15:00-15:30 | Coffee break | |
| 15:30-17:30 | Worksession | |
| ab 17:30 | Reception and evening program |
Friday, December 2
| 09:00-09:30 | Coffee | |
| 09:30-10:15 | The Lasserre hierarchy for equiangular lines with a fixed angle | Willem de Muinck Keizer |
| 10:15-10:45 | Coffee break | |
| 10:45-11:15 | A specialized SDP solver for sums-of-squares problems in discrete geometry | Nando Leijenhorst |
| 11:30-12:00 | Three-point bounds for sphere packing | David de Laat |
| 12:00-13:30 | Lunch break | |
| 13:30-14:15 | The Coclique Number of Orthogonality Graphs | Ferdinand Ihringer |
| 14:30-15:00 | Least Euclidean Distortion Embeddings of Flat Tori | Arne Heimendahl |
| 15:00 | Departure |
Participants
- Bram Bekker, TU Delft
- Daniel Brosch, Universität Klagenfurt
- David de Laat, TU Delft
- Willem de Muinck, TU Delft
- Markus Faulhuber, Universität Wien
- Toni Golian, Universität zu Köln
- Arne Heimendahl, Universität zu Köln
- Ferdinand Ihringer, Universiteit Gent
- Nando Leijenhorst, TU Delft
- Karla Leipold, Universität zu Köln
- Sebastian Miebach, Universität zu Köln
- Philippe Moustrou, Université de Toulouse
- Fernando Oliveira, TU Delft
- Jana Pier, Universität zu Köln
- Jan Hendrik Rolfes, KTH Stockholm
- Robert Schüler, Universität Rostock
- Melanie Siebenhofer, Universität Klagenfurt
- Andreas Spomer, Universität zu Köln
- Frank Vallentin, Universität zu Köln
- Steffen Weißbach, Universität zu Köln
- Angelika Wiegele, Universität Klagenfurt
- Marc Christian Zimmermann, Universität zu Köln
Organization: Annette Koenen, Frank Vallentin, Marc Christian Zimmermann