时间：2024年5月27日（星期一）15:00
地点：西湖大学云谷校区E4-233
主持人：理论betway必威棋牌网址 院 古星
主讲人：清华大学丘成桐数学科学中心 陈伟彦
报告主题：Topological complexity of enumerative problems
摘要：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.
