Lionel Lang: Braid monodromy of polynomial systems

Date: 2023-06-26

Time: 13:30 - 14:30

Zoom link:


Lionel Lang, Högskolan i Gävle


Given an enumerative problem, it is of interest to compute its monodromy group, that is permutations of the set of solutions to the problem given by travelling loops in the space of conditions. In this talk, we want to advertise the computation of braid monodromy rather than the bare monodromy, especially in the context of Bernstein-Kouchnirenko type of enumerative problems. We also want to illustrate how tools from toric/tropical geometry can be used in these computations. This is a report on our collaboration with Alex Esterov over the past few years.