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
Measuring Similarity between Logical Arguments
Automated Reasoning
Monday 06 March 2023 - 00:00
Salle : 0 - 650
Victor David .............................................

Imputing Out-of-Vocabulary Embeddings with LOVE Ma
Data-Centric Languages and Systems
Monday 20 February 2023 - 00:00
Salle : 455 - PCRI-N
Lihu Chen .............................................

On the Interplay between Software Product Lines an
Automated Reasoning
Tuesday 18 October 2022 - 14:15
Salle : 2013 - DIG-Moulon
Vander Alves .............................................

Combining randomized and observational data: Towar
Automated Reasoning
Thursday 13 October 2022 - 10:30
Salle : 2011 - DIG-Moulon
Bénédicte Colnet .............................................

New Achievements of Artificial Intelligence in Mul
Automated Reasoning
Tuesday 11 October 2022 - 14:15
Salle : 2013 - DIG-Moulon
.............................................