Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Lattice polytopes with large diameter and many vertices
Antoine Deza

31 March 2017, 14h30
Salle/Bat : 435/PCRI-N
Contact :

Activités de recherche : Combinatoire

Résumé :
A lattice (d,k)-polytope is the convex hull of a set of points in dimension d, whose coordinates are integers between 0 and k. In this talk, we will introduce lattice polytopes generated by the primitive vectors of bounded norm. These primitive zonotopes can be seen as a generalization of the permutahedron of type Bd. We will highlight connections between the primitive zonotopes and the largest possible diameter of lattice (d,k)-polytopes, and between the computational complexity of multicriteria matroid optimization. Tightening of the bounds for the largest possible diameter of a lattice (d,k)-polytope, complexity results, conjectures, and open questions will be discussed. Based on joint works with Nathan Chadder, George Manoussakis, Shmuel Onn, and Lionel Pournin.

Pour en savoir plus :
Séminaires
Programming computing media (reporté)
Combinatoire
Friday 18 September 2020 - 14h30
Salle : 445 - PCRI-N
Frédéric Gruau .............................................

forum-dev Continuous Integration
Friday 05 June 2020 - 10h00
Salle : 0 - 650
Erik Bray .............................................

Large-scale Spectral Clustering for GPU-based Plat
Calcul à haute performance
Tuesday 24 March 2020 - 10h30
Salle : 465 - PCRI-N
Guanlin He .............................................

Recherche Opérationnelle à Google
Optimisation combinatoire et stochastique
Thursday 12 March 2020 - 14h30
Salle : 445 - PCRI-N
Laurent Perron .............................................

Forum dev-LRI
Wednesday 05 February 2020 - 14h00
Salle : 455 - PCRI-N
Erik Bray .............................................