Proceedings of the 28-th International Conference on Formal Power Series and Algebraic Combinatorics
4-8 Jul 2016 Vancouver, British Columbia (Canada)
A combinatorial analysis of Severi degrees
Fu Liu  1  
1 : University of California [Davis, USA]  (UC Davis)  -  Website
One Shields Avenue, , Davis, CA 95616-5294 -  États-Unis

Based on results by Brugall´e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical
Severi degrees Nd; using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version
of a special function associated to long-edge graphs which 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.

  • Poster
Online user: 1