A combinatorial analysis of Severi degrees

DOI10.1016/J.AIM.2016.04.011zbMATH Open1339.05018arXiv1304.1256OpenAlexW2963657393MaRDI QIDQ291745FDOQ291745

Fu Liu

Publication date: 10 June 2016

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

Abstract: Based on results by Brugall'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d,delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a special function associated to long-edge graphs appeared in Fomin-Mikhalkin's formula, and conjectured it to be linear. They have since proved their conjecture. At the same time, motivated by their conjecture, we consider a special multivariate function associated to long-edge graphs that generalizes their function. The main result of this paper is that the multivariate function we define is always linear. A special case of our result gives an independent proof of Block-Colley-Kennedy's conjecture. The first application of our linearity result is that by applying it to classical Severi degrees, we recover quadraticity of $Q^{d,delta}$ and a bound $delta$ for the threshold of polynomiality of $N^{d,delta}.$ Next, in joint work with Osserman, we apply the linearity result to a special family of toric surfaces and obtain universal polynomial results having connections to the G"ottsche-Yau-Zaslow formula. As a result, we provide combinatorial formulas for the two unidentified power series $B_1(q)$ and $B_2(q)$ appearing in the G"ottsche-Yau-Zaslow formula. The proof of our linearity result is completely combinatorial. We define $au$-graphs which generalize long-edge graphs, and a closely related family of combinatorial objects we call $(au,n)$-words. By introducing height functions and a concept of irreducibility, we describe ways to decompose certain families of $(au,n)$-words into irreducible words, which leads to the desired results.

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)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Computing Severi degrees with long-edge graphs
• Combinatorial properties of the G-degree

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The combinatorial degrees of proofs and equations 👍 👎
• A note on initial segments of the enumeration degrees 👍 👎
• On a degree sequence analogue of Pósa's conjecture 👍 👎
• Analytic Combinatorics 👍 👎
• Combinatorial properties of the G-degree 👍 👎

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

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