A combinatorial analysis of Severi degrees

DOI10.1016/j.aim.2016.04.011zbMath1339.05018arXiv1304.1256OpenAlexW2963657393MaRDI QIDQ291745

Fu Liu

Publication date: 10 June 2016

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

irreducible\((\tau, n)\)-wordsquadraticSeveri degree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumerative problems (combinatorial problems) in algebraic geometry (14N10)

Related Items (1)

Computing Severi degrees with long-edge graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the Göttsche-Yau-Zaslow formula
• Computing Severi degrees with long-edge graphs
• Labeled floor diagrams for plane curves
• A short proof of the Göttsche conjecture
• On the Severi problem
• A conjectural generating function for numbers of curves on surfaces
• Counting plane curves of any genus
• Universal polynomials for Severi degrees of toric surfaces
• Enumeration of curves via floor diagrams
• Computing node polynomials for plane curves
• Floor decompositions of tropical curves : the planar case
• THE DI FRANCESCO–ITZYKSON–GÖTTSCHE CONJECTURES FOR NODE POLYNOMIALS OF ℙ²
• On the G\"ottsche Threshold

This page was built for publication: A combinatorial analysis of Severi degrees