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, 14:30
Salle/Bat : 435/PCRI-N
Contact :

Activités de recherche : Combinatorics

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
Pierre Andrieu - Agrégation de classements pour le
Thursday 21 October 2021 - 00:00
Salle : 435 - PCRI-N
.............................................

A counting argument for graph colouring
Graph Theory
Friday 08 October 2021 - 11:00
Salle : 445 - PCRI-N
Francois Pirot .............................................

Demographic reconstruction from paleogenomes of th
Thursday 25 February 2021 - 14:00
Salle : 435 - PCRI-N
Nina Marchi .............................................

A Graph-based Similarity Approach to Classify Recu
Thursday 18 February 2021 - 14:00
Salle : 435 - PCRI-N
Coline Gianfrotta .............................................

"Answer Set Programming for computing constraints-
Thursday 04 February 2021 - 14:00
Salle : 435 - PCRI-N
Maxime Mahout .............................................