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...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
| Colección: | Discrete Mathematics & Theoretical Computer Science |
| Materias: | |
| Acceso en línea: | https://dmtcs.episciences.org/6385/pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|