English

Relative Node Polynomials for Plane Curves

Algebraic Geometry 2012-08-24 v4 Combinatorics

Abstract

We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and delta nodes is given by a polynomial in d, provided delta is fixed and d is large enough. We extend this result to generalized Severi varieties parametrizing plane curves which, in addition, satisfy tangency conditions of given orders with respect to a given line. We show that the degrees of these varieties, appropriately rescaled, are given by a combinatorially defined "relative node polynomial" in the tangency orders, provided the latter are large enough. We describe a method to compute these polynomials for arbitrary delta, and use it to present explicit formulas for delta <= 6. We also give a threshold for polynomiality, and compute the first few leading terms for any delta.

Keywords

Cite

@article{arxiv.1009.5063,
  title  = {Relative Node Polynomials for Plane Curves},
  author = {Florian Block},
  journal= {arXiv preprint arXiv:1009.5063},
  year   = {2012}
}

Comments

27 pages, final version, to be published in Journal of Algebraic Combinatorics

R2 v1 2026-06-21T16:19:05.669Z