Combinatorics and Arithmetic for Physics: special days

Collection Combinatorics and Arithmetic for Physics: special days

Organizer(s) Gérard H.E. Duchamp, Maxim Kontsevich, Gleb Koshevoy et Vincel Hoang Ngoc Minh
Date(s) 11/30/21 - 12/2/21
linked URL https://indico.math.cnrs.fr/event/7040/
00:00:00 / 00:00:00
20 20

Distance, Strong Convexity, Flagness, and Associahedra

By Lionel Pournin

One can always transform a triangulation of a convex polygon into another by performing a sequence of edge flips, which amounts to follow a path in the graph G of the associahedron. The least number of flips required to do so is then a distance in that graph whose estimation is instrumental in a variety of contexts, as for instance in computational biology, in computer science, or in algebraic topology. On the other hand, it is known that paths in G correspond to a certain kind of 3-dimensional triangulation. This talk is about the recent proof that these 3-dimensional triangulations are flag when the corresponding path is a geodesic. This result, that provides a new powerful tool to study the geometry of G, can be thought of as a 3-dimensional analogue of a well-known strong convexity property of G. Several consequences on the computation of distances in G and on strong convexity in related graphs will be discussed. This talk is based on joint work with Zili Wang (Dartmouth College).

Information about the video

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback