Mercredi 2 Mai


Retour à la vue des calendrier
Mercredi 2 Mai
Heure: 14:00 - 15:00
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Discrete convexity and applications to combinatorics and optimization
Description: Gleb Koshevoy I will explain theory convexity for lattices, free Abelian groups without torsion. I will show that a famous class of polytopes, polymatroids of combinatorial optimization, is related to one of classes of discrete convexity. Several instances of discretely convex functions related to combinatorics of Young tableaux will be demonstrated.