Topological Complexity of Enumerative Problems in Classical Algebraic Geometry
Applied Algebraic Topology Network via YouTube
Learn Generative AI, Prompt Engineering, and LLMs for Free
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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