Differences

This shows you the differences between two versions of the page.

--- workshops:workshop0224 [2024/01/31 11:28] – geiselmann
+++ workshops:workshop0224 [2024/02/06 11:21] (current) – [polymake conference] weis
@@ Line 10: / Line 10: @@
 ===Location===
 The workshop will take place in the E-N building of TU Berlin in the rooms 058 and 057. See [[https://maps.app.goo.gl/t7fztRZ5JW22CF8WA|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.
@@ Line 22: / Line 24: @@
 | :::          | // Volker Kaibel //                                                        |                                    ||
 | 10:30-11:00  | **Break and Helpdesk**                                                                                   ||
-| 11:00-12:00  | **Tut: Polymake Basics **                            | **Tut: Serialization**   ||
+| 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  | **Coarsest subdivisions**                            | **Johnson solids**     |
+| 14:00-15:00  | **Regular subdivisions**                            | **Johnson solids**     |
 | :::          | // Laura Casabella //                                | //Alexej Jordan and Zoe Geiselmann//               |
 | 15:00-15:30  | **Break and Helpdesk**                                                                                   ||
@@ Line 42: / Line 44: @@
 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 {{ :workshops:polymake_basics.ipynb |here}}.
 == Antony Della Vecchia: Serialization ==
@@ Line 51: / Line 58: @@
 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, hypersimplices and show how polymake deals with these objects. The corresponding jupyter notebook can be downloaded {{ :workshops:regular_subdivisions_of_hypersimplices_final.ipynb |here}}.
+== 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:=====