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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
| coleção: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acesso em linha: | https://dmtcs.episciences.org/6385/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|