用长边图计算Severi度
Computing Severi Degrees with Long-edge Graphs
摘要:
本文研究了一类具有多条边的图,以便用初等组合术语来理解塞维里度生成级数的形式对数的性质。这些图与平面热带曲线相关的平面图有关,最初由Brugalle和Mikhalkin开发,并由Block,Fomin和Mikhalkin用于计算射影平面的Severi度和平面曲线的节点多项式。
英文摘要:
We study a class of graphs with finitely many edges in order to understand the nature of the formal logarithm of the generating series for Severi degrees in elementary combinatorial terms. These graphs are related to floor diagrams associated to plane tropical curves originally developed by Brugalle and Mikhalkin, and used by Block, Fomin, and Mikhalkin to calculate Severi degrees of the projective plane and node polynomials of plane curves.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。