Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
workshops:workshop0224 [2024/01/31 16:37] – [polymake conference] casabella | workshops:workshop0224 [2024/02/06 11:21] (current) – [polymake conference] weis | ||
---|---|---|---|
Line 24: | Line 24: | ||
| ::: | // Volker Kaibel // | || | | ::: | // Volker Kaibel // | || | ||
| 10: | | 10: | ||
- | | 11: | + | | 11: |
| ::: | // George Balla // | //Antony Della Vecchia// || | | ::: | // George Balla // | //Antony Della Vecchia// || | ||
| 12: | | 12: | ||
Line 44: | 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. | 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 == | == Antony Della Vecchia: Serialization == | ||
Line 55: | Line 60: | ||
== Laura Casabella: Regular subdivisions of hypersimplices == | == Laura Casabella: Regular subdivisions of hypersimplices == | ||
- | In this tutorial we introduce regular subdivisions, | + | 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: |