moteur de recherche

Séminaire Algo - Arnau Padrol
Séminaire Algo - Arnau Padrol
7-nov.-2017 14:30
Il y a: 3 yrs

Arnau Padrol

On the extension complexity of polytopes

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: The extension complexity of a polytope is the minimal number of facets of a polytope that can be linearly projected onto it. This apparently simple combinatorial geometry problem has been the object of extensive research motivated from applications in linear programming and non-negative factorizations. Yet, many basic questions are still unresolved and there are very few polytopes for which the exact extension complexity is known. I will present some open questions and discuss the extension complexity of polygons and polytopes with few vertices.

<- retour: