Labeled floor diagrams for plane curves

By Sergey Fomin, G. Mikhalkin. 2009

73 citations recorded by the source corpus.

Floor diagrams are a class of weighted oriented graphs introduced by E. Brugalle and the second author. Tropical geometry arguments lead to combinatorial descriptions of (ordinary and relative) Gromov-Witten invariants of projective spaces in terms of floor diagrams and their generalizations. In a number of cases, these descriptions can be used to obtain explicit (direct or recursive) formulas for the corresponding enumerative invariants. In particular, we use this approach to enumerate rational curves of given degree passing through a collection of points on the complex plane and having maximal tangency to a given line. Another application of the combinatorial approach is a proof of a conjecture by P. Di Francesco -- C. Itzykson and L. Goettsche that in the case of a fixed cogenus, the number of plane curves of degree d passing through suitably many generic points is given by a polynomial in d, assuming that d is sufficiently large. Furthermore, the proof provides a method for computing these "node polynomials." A labeled floor diagram is obtained by labeling the vertices of a floor diagram by the integers 1,...,d in a manner compatible with the orientation. We show that labeled floor diagrams of genus 0 are equinumerous to labeled trees, and therefore counted by the celebrated Cayley's formula. The corresponding bijections lead to interpretations of the Kontsevich numbers (the genus-0 Gromov-Witten invariants of the projective plane) in terms of certain statistics on trees.

Subfields: Computational Mechanics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design

View Paper: https://www.semanticscholar.org/paper/90e9bab7573ec23674366b3d3b36b78a466512c4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

1. I. Itenberg
2. L. Gottsche
3. Florian Block
4. G. Mikhalkin

In Computational Theory and Mathematics

1. I. Itenberg
2. L. Gottsche
3. Florian Block
4. G. Mikhalkin
5. Eugenii Shustin
6. Erwan Brugallé
7. Eric Katz
8. Melody Chan

In Computer Graphics and Computer-Aided Design

1. I. Itenberg
2. L. Gottsche
3. Florian Block
4. G. Mikhalkin

Citations in the corpus

• On Block-Goettsche multiplicities for planar tropical curves (2012, methodology): “One can easily obtain these formulas from Appendix A (the table) of [6] listing the floor diagrams for relevant g and d.”
• Refined curve counting with tropical geometry (2014, methodology): “We present them in the notation of Ardila and Block [1], following Fomin and Mikhalkin [10].”