The University of Michigan Combinatorics Seminar
Fall 2006
September 8, 3:10-4:00, 4088 East Hall

Curves in Pn: inductive enumeration by dimension

Grigory Mikhalkin

University of Toronto


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