Curves in P^{n}: inductive enumeration by dimension

Grigory Mikhalkin

University of Toronto

Abstract

The enumerative problem we are concerned about is
computing the number of curves of given degree and genus subject
to some incidence conditions in P^{n} (over complex or real numbers).
We present an inductive (by n) solution that reduces such problems
to the corresponding enumerative problem in P^{1} (which is trivial).
Joint work with E. Brugalle.