A combinatorial analysis of Severi degrees

Based on results by Brugallé 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 versionof a special function associated to long-edge graphs which appeared in Fomin-Mikhalki...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Author:	Fu Liu
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2020-04-01
Subjects:	[math.math-co]mathematics [math]/combinatorics [math.co]
Online Access:	https://dmtcs.episciences.org/6385/pdf