Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
workshops:workshop0224 [2023/12/03 20:12] – [polymake conference] Add preliminary schedule lkastner | workshops:workshop0224 [2024/02/06 11:21] (current) – [polymake conference] weis | ||
---|---|---|---|
Line 7: | Line 7: | ||
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.\\ | 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.\\ | ||
+ | |||
+ | ===Location=== | ||
+ | The workshop will take place in the E-N building of TU Berlin in the rooms 058 and 057. See [[https:// | ||
+ | |||
+ | **Warning: | ||
Line 16: | Line 21: | ||
^ **Friday** | ^ **Friday** | ||
| 09: | | 09: | ||
- | | 09: | + | | 09: |
| ::: | // Volker Kaibel // | || | | ::: | // Volker Kaibel // | || | ||
| 10: | | 10: | ||
- | | 11: | + | | 11: |
- | | ::: | // TBA // | + | | ::: | // George Balla // |
- | | 12: | + | | 12: |
- | | 14: | + | | 14: |
- | | ::: | // TBA // | + | | ::: | // Laura Casabella |
| 15: | | 15: | ||
- | | 15: | + | | 15: |
+ | | ::: | ||
+ | | ::: | // Andrei Comăneci // || | ||
+ | | ::: | ** 2. Quantum groups ** || | ||
+ | | ::: | // Marcel Wack // || | ||
| 16: | | 16: | ||
| ~18: | | ~18: | ||
Line 32: | Line 41: | ||
=== Abstracts === | === Abstracts === | ||
- | == Volker Kaibel: | + | == Volker Kaibel: |
+ | |||
+ | 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. | ||
+ | |||
+ | == George Balla: Basics == | ||
+ | |||
+ | In this tutorial, we will see some basic computations with polymake objects. The jupyter notebook for this tutorial can be downloaded {{ : | ||
+ | |||
+ | |||
+ | == Antony Della Vecchia: Serialization == | ||
+ | |||
+ | 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. | ||
+ | |||
+ | == Alexej Jordan and Zoe Geiselmann: How to produce a Johnson solid in OSCAR == | ||
+ | |||
+ | 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. | ||
+ | |||
+ | == Laura Casabella: Regular subdivisions of hypersimplices == | ||
+ | |||
+ | In this tutorial we introduce regular subdivisions, | ||
+ | |||
+ | == Andrei Comăneci: Phylogenetic trees == | ||
+ | |||
+ | We talk about phylogenetic trees and how we can work with them in OSCAR. | ||
+ | |||
+ | == Marcel Wack: Quantum groups == | ||
+ | |||
+ | 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. | ||
=====Hotel recommendations in proximity of the Institute of Mathematics: | =====Hotel recommendations in proximity of the Institute of Mathematics: | ||
Line 48: | Line 84: | ||
===== Local organizers ===== | ===== Local organizers ===== | ||
- [[https:// | - [[https:// | ||
+ | - [[https:// | ||
+ | - [[https:// | ||
Please contact us with any questions about the workshop. To email us, please use '' | Please contact us with any questions about the workshop. To email us, please use '' |