Title
Computational Enumerative Geometry
Abstract
Classically, an enumerative problem takes the form of a deceptively simple question: “How many geometric objects satisfy a given collection of geometric constraints, given by some input data?”. For example, there is exactly 1 circle through three points, 27 lines on a smooth cubic surface, and 3264 conics tangent to five conics in the plane.
But counting is only the beginning. Once we know there are finitely many solutions, we can ask richer questions:
(Monodromy) How do the solutions permute as the input data varies
(Reality) If the input is real, how many solutions can be real?
(Formula) Is there a formula for the solutions, analogous to the quadratic formula?
(Computation) How can we compute all of the solutions?
These questions connect classical enumerative geometry with other areas including group theory, field theory, computation, and topology.
In this talk, I will introduce ‘numerical algebraic geometry’ as a computational approach to these problems. Through many examples from both ‘pure’ and ‘applied’ mathematics, I will show how tools from numerical algebraic geometry allow us to explore enumerative problems through computation and experimentation. I will conclude by highlighting some of the projects currently being explored by our research group at Western University.