Computing node polynomials for plane curves

From MaRDI portal
Publication:2392982

DOI10.4310/MRL.2011.V18.N4.A4zbMATH Open1288.14038arXiv1006.0218MaRDI QIDQ2392982FDOQ2392982


Authors: Florian Block Edit this on Wikidata


Publication date: 5 August 2013

Published in: Mathematical Research Letters (Search for Journal in Brave)

Abstract: According to the G"ottsche conjecture (now a theorem), the degree N^{d, delta} of the Severi variety of plane curves of degree d with delta nodes is given by a polynomial in d, provided d is large enough. These "node polynomials" N_delta(d) were determined by Vainsencher and Kleiman-Piene for delta <= 6 and delta <= 8, respectively. Building on ideas of Fomin and Mikhalkin, we develop an explicit algorithm for computing all node polynomials, and use it to compute N_delta(d) for delta <= 14. Furthermore, we improve the threshold of polynomiality and verify G"ottsche's conjecture on the optimal threshold up to delta <= 14. We also determine the first 9 coefficients of N_delta(d), for general delta, settling and extending a 1994 conjecture of Di Francesco and Itzykson.


Full work available at URL: https://arxiv.org/abs/1006.0218




Recommendations





Cited In (19)





This page was built for publication: Computing node polynomials for plane curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392982)