On Friday there will be an invited talk and several tutorials, demos and helpdesk sessions for polymake users.
Participants are encouraged to use a laptop with an installed version of polymake in the tutorials. If you have any polymake problem you want to get help during the workshop please describe your problem during the sign up process.
The workshop will take place in the E-N building of TU Berlin in the rooms 058 and 057. See here for a pin.
Warning: On Friday there is a strike of parts of the public transport in Berlin until 10am. Until 10am only the S-Bahn will operate normally.
Please fill out the registration form!
| Friday | |||
|---|---|---|---|
| 09:00-09:30 | Registration | ||
| 09:30-10:30 | Talk: Linear Programming and Diameters of Polytopes | ||
| Volker Kaibel | |||
| 10:30-11:00 | Break and Helpdesk | ||
| 11:00-12:00 | Tut: Polymake Basics E-N 058 | Tut: Serialization E-N 058 | |
| George Balla | Antony Della Vecchia | ||
| 12:00-14:00 | Lunch and Coffee | ||
| 14:00-15:00 | Regular subdivisions | Johnson solids | |
| Laura Casabella | Alexej Jordan and Zoe Geiselmann | ||
| 15:00-15:30 | Break and Helpdesk | ||
| 15:30-16:30 | Use cases: | ||
| 1. Phylogenetic trees | |||
| Andrei Comăneci | |||
| 2. Quantum groups | |||
| Marcel Wack | |||
| 16:30-18:15 | Helpdesk | ||
| ~18:45 | Dinner (self paid, at Café Hardenberg) | ||
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch-conjecture. Those constructions can be used to show that if there is a pivot rule (executable by a strongly polynomial time algorithm) for the simplex algorithm for which one can bound the number of steps by the diameters of the bases-exchange graphs of the polyhedra of feasible solutions then the general linear programming problem can be solved in strongly polynomial time. The talk is based on joint work with Kirill Kukharenko.
In this tutorial, we will see some basic computations with polymake objects. The jupyter notebook for this tutorial can be downloaded here.
We will give an overview of serialization and how it can be useful for collaboration. We'll look at serialization in polymake and OSCAR, highlighting some of their similarities and differences.
In this short presentation we show how to compute the exact vertices of a Johnson solid and how to feed them into OSCAR in order to produce such a polytope.
In this tutorial we introduce regular subdivisions, hypersimplices and show how polymake deals with these objects. The corresponding jupyter notebook can be downloaded here.
We talk about phylogenetic trees and how we can work with them in OSCAR.
We'll talk about compact quantum groups, in particular quantum automorphism groups of matroids and graphs, and the tools OSCAR has for working with them.
The developer meeting takes place on February 1st and 3rd. If you want to participate in the developer meeting as well, please let us know by email. Developers can find more information here.
Please contact us with any questions about the workshop. To email us, please use LASTNAME@math.tu-berlin.de.