Time：15:00, Monday, May 27 2024
Venue：E4-233, Yungu Campus
Host：Xing Gu, ITS
Speaker：Weiyan Chen, Yau Mathematical Sciences Center, Tsinghua University
Title：Topological complexity of enumerative problems
Abstract：How complex is the solution of a polynomial equation? One way to measure such complexity is provided by topological complexity in the sense of Smale, who proved that any algorithm that finds roots of a polynomial must be sufficiently complicated. However, finding roots of a polynomial is just one basic example of enumerative problems in algebraic geometry. In this talk, we will consider the problem of finding flex points on smooth cubic plane curves. We prove a lower bound for the topological complexity of this problem, and show that our bound is close to be best possible. This talk is based on joint work with Zheyan Wan.
