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
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................