Topological Complexity of Enumerative Problems in Classical Algebraic Geometry
Applied Algebraic Topology Network via YouTube
The Most Addictive Python and SQL Courses
PowerBI Data Analyst - Create visualizations and dashboards from scratch
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a mathematical lecture that delves into utilizing topological complexity, as defined by Smale, to evaluate the complexity of enumerative problems in classical algebraic geometry. Through four detailed examples, discover lower bounds for Schwarz genera of covers associated with these enumerative problems. Learn about the technical challenges involved in understanding cohomology classes of BPU_n (classifying spaces of projective unitary groups) in this joint research presentation by Weiyan Chen, Zheyan Wan, and Xing Gu.
Syllabus
Weiyan Chen (1/23/25): Topological complexity of enumerative problems
Taught by
Applied Algebraic Topology Network