Discrete Mathematics & Theoretical Computer Science |

- 1 Department of Mathematics - University of Michigan

We generalize the recent work of Fomin and Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and δ nodes is given by a polynomial in d, provided δ 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 δ , and use it to present explicit formulas for δ ≤ 6. We also give a threshold for polynomiality, and compute the first few leading terms for any δ .

Source: HAL:hal-01215084v1

Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)

Section: Proceedings

Published on: January 1, 2011

Imported on: January 31, 2017

Keywords: enumerative geometry,floor diagram,Gromov-Witten theory,node polynomial,tangency conditions,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 175 times.

This article's PDF has been downloaded 141 times.