{"id":6573,"date":"2022-11-07T00:41:23","date_gmt":"2022-11-06T23:41:23","guid":{"rendered":"http:\/\/www.mi.uni-koeln.de\/opt\/?page_id=6573"},"modified":"2022-11-30T10:50:23","modified_gmt":"2022-11-30T09:50:23","slug":"three-days-of-computational-methods-for-extremal-discrete-geometry","status":"publish","type":"page","link":"http:\/\/www.mi.uni-koeln.de\/opt\/three-days-of-computational-methods-for-extremal-discrete-geometry\/","title":{"rendered":"Three days of computational methods for extremal discrete geometry"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">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.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Locations<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Hotel:<\/strong> Hotel Flandrischer Hof <a href=\"https:\/\/www.flandrischerhof.de\">https:\/\/www.flandrischerhof.de<\/a><br><br><strong>Wednesday:<\/strong> \u00dcbungsraum 2, Gyrhofstra\u00dfe 8, 50931 K\u00f6ln. <a href=\"https:\/\/goo.gl\/maps\/4NrVrWHMZnKTiBSWA\">https:\/\/goo.gl\/maps\/4NrVrWHMZnKTiBSWA<\/a><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The entrance of the building ist located on its backside, please use the one on the &#8222;long&#8220; 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.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Thursday\/Friday: <\/strong>Room 1.03, RRZK Universit\u00e4t zu K\u00f6ln, Weyertal 121, 50931 K\u00f6ln. <a href=\"https:\/\/goo.gl\/maps\/ZtFDeP6MbvDNrKC5A\">https:\/\/goo.gl\/maps\/ZtFDeP6MbvDNrKC5A<\/a><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Public Transport:<\/strong> <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We recommend <a href=\"https:\/\/www.bahn.de\">https:\/\/www.bahn.de<\/a> if you want to plan your trip.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Tramstop S\u00fclz Universit\u00e4t, 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\u00f6ln Messe\/Deutz you can use line STR 9 directly from there.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Schedule<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Wednesday, November 30<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>11:00-12:00<\/td><td>Arrival and coffee<\/td><td><\/td><\/tr><tr><td>12:00-13:30<\/td><td>Lunch break<\/td><td><\/td><\/tr><tr><td>13:30-14:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/MFaulhuber.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">A new kind of packing and covering<\/a><\/td><td>Markus Faulhuber<\/td><\/tr><tr><td>14:30-15:00<\/td><td>News approaches to Polarization<\/td><td>Jan Rolfes<\/td><\/tr><tr><td>15:00-15:30<\/td><td>Coffee break<\/td><td><\/td><\/tr><tr><td>15:30-17:30<\/td><td>Worksession<\/td><td><\/td><\/tr><tr><td>17:30 <\/td><td>Evening program<\/td><td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Thursday, December 1<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>09:00-09:30<\/td><td>Coffee<\/td><td><\/td><\/tr><tr><td>09:30-10:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/FOliveira.pdf\">Optimization hierarchies for distance-avoiding sets<\/a><\/td><td>Fernando de Oliveira Filho<\/td><\/tr><tr><td>10:15-10:45<\/td><td>Coffee break<\/td><td><\/td><\/tr><tr><td>10:45-11:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/BBekker.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">Asymptotic convergence of k-point bounds on compact packing graphs<\/a><\/td><td>Bram Bekker<\/td><\/tr><tr><td>11:30-12:00<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/MSiebenhofer.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">Evaluating the connectivity of a graph using semidefinite programming<\/a><\/td><td>Melanie Siebenhofer<\/td><\/tr><tr><td>12:00-13:30<\/td><td>Lunch break<\/td><td><\/td><\/tr><tr><td>13:30-14:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/PMoustrou.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">Computing spectral bounds for geometric graphs via polynomial optimization<\/a><\/td><td>Philippe Moustrou<\/td><\/tr><tr><td>14:30-15:00<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/DBrosch.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">New lower bounds on crossing numbers of K_{m,n} from permutation modules and semidefinite programming<\/a><\/td><td>Daniel Brosch<\/td><\/tr><tr><td>15:00-15:30<\/td><td>Coffee break<\/td><td><\/td><\/tr><tr><td>15:30-17:30<\/td><td>Worksession<\/td><td><\/td><\/tr><tr><td>ab 17:30<\/td><td>Reception and evening program<\/td><td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Friday, December 2<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>09:00-09:30<\/td><td>Coffee<\/td><td><\/td><\/tr><tr><td>09:30-10:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/WdMuinkKeizer.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">The Lasserre hierarchy for equiangular lines with a fixed angle<\/a><\/td><td>Willem de Muinck Keizer<\/td><\/tr><tr><td>10:15-10:45<\/td><td>Coffee break<\/td><td><\/td><\/tr><tr><td>10:45-11:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/NLeijenhorst.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">A specialized SDP solver for sums-of-squares problems in discrete geometry<\/a><\/td><td>Nando Leijenhorst<\/td><\/tr><tr><td>11:30-12:00<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/DdLaat.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">Three-point bounds for sphere packing<\/a><\/td><td>David de Laat<\/td><\/tr><tr><td>12:00-13:30<\/td><td>Lunch break<\/td><td><\/td><\/tr><tr><td>13:30-14:15<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/FIhringer.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">The Coclique Number of Orthogonality Graphs<\/a><\/td><td>Ferdinand Ihringer<\/td><\/tr><tr><td>14:30-15:00<\/td><td><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2022\/11\/AHeimendahl.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">Least Euclidean Distortion Embeddings of Flat Tori<\/a><\/td><td>Arne Heimendahl<\/td><\/tr><tr><td>15:00<\/td><td>Departure<\/td><td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Participants<\/h2>\n\n\n\n<ul class=\"wp-block-list\"><li>Bram Bekker, TU Delft<\/li><li>Daniel Brosch, Universit\u00e4t Klagenfurt<\/li><li>David de Laat, TU Delft<\/li><li>Willem de Muinck, TU Delft<\/li><li>Markus Faulhuber, Universit\u00e4t Wien<\/li><li>Toni Golian, Universit\u00e4t zu K\u00f6ln<\/li><li>Arne Heimendahl, Universit\u00e4t zu K\u00f6ln<\/li><li>Ferdinand Ihringer, Universiteit Gent<\/li><li>Nando Leijenhorst, TU Delft<\/li><li>Karla Leipold, Universit\u00e4t zu K\u00f6ln<\/li><li>Sebastian Miebach, Universit\u00e4t zu K\u00f6ln<\/li><li>Philippe Moustrou, Universit\u00e9 de Toulouse<\/li><li>Fernando Oliveira, TU Delft<\/li><li>Jana Pier, Universit\u00e4t zu K\u00f6ln<\/li><li>Jan Hendrik Rolfes, KTH Stockholm<\/li><li>Robert Sch\u00fcler, Universit\u00e4t Rostock<\/li><li>Melanie Siebenhofer, Universit\u00e4t Klagenfurt<\/li><li>Andreas Spomer, Universit\u00e4t zu K\u00f6ln<\/li><li>Frank Vallentin, Universit\u00e4t zu K\u00f6ln<\/li><li>Steffen Wei\u00dfbach, Universit\u00e4t zu K\u00f6ln<\/li><li>Angelika Wiegele, Universit\u00e4t Klagenfurt<\/li><li>Marc Christian Zimmermann, Universit\u00e4t zu K\u00f6ln<\/li><\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Organization:<\/strong> Annette Koenen, Frank Vallentin, Marc Christian Zimmermann<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 &hellip; <a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/three-days-of-computational-methods-for-extremal-discrete-geometry\/\" class=\"more-link\"><span class=\"screen-reader-text\">&#8222;Three days of computational methods for extremal discrete geometry&#8220; <\/span>weiterlesen<\/a><\/p>\n","protected":false},"author":11,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-6573","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/6573","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/users\/11"}],"replies":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/comments?post=6573"}],"version-history":[{"count":14,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/6573\/revisions"}],"predecessor-version":[{"id":6612,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/6573\/revisions\/6612"}],"wp:attachment":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/media?parent=6573"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}