Search arXivSearch

arXiv · math/0209253

Counting curves via lattice paths in polygons

Abstract

This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms of certain lattice paths in the relevant Newton polygon. If the toric surface is the projective plane or the product of two projective lines then the invariants under consideration coincide with the Gromov-Witten invariants. The formula gives a new count even in these cases, where other computational technique is available.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grigory Mikhalkin. 2003-04-05. Counting curves via lattice paths in polygons. https://arxiv.org/abs/math/0209253

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Braid and Phantom

Let N be the moduli space of stable rank 2 vector bundles on a smooth projective curve of genus g>1 with fixed odd determinant. With Sebastian Torres, we previously found a semi-orthogonal decomposition of the bounded derived category of N into bounded derived categories of symmetric powers of the curve and, possibly, a phantom block. In this work, we employ the theory of weaving patterns to eliminate the possibility of a phantom, completing the proof of the decomposition conjectured by Narasimhan and, independently, by Belmans, Galkin, and Mukhopadhyay.

math.AG

On the Alexander polynomials of conic-line arrangements

In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen pencils of index $k\geq 2$. Then we apply them to the Hesse arrangement of conics and to some of its degenerations. The results are completed by computations using computer algebra. In particular, we construct conic-line arrangements which are non-reduced pencil-type arrangements and have as roots of their Alexander polynomials roots of unity of order 7. Such roots are not known and are conjectured not to exist in the class of line arrangements.

math.AG

On the Tensor Property of Bernstein-Sato Polynomial

We prove the multiplicative Thom-Sebastiani rule for Bernstein-Sato polynomials, answering the longstanding questions of Budur and Popa. We generalize the result to the tensor of two effective divisors on the product of two arbitrary non-singular complex varieties. This also leads to a multiplicative property related to Igusa's strong monodromy conjecture. Moreover, we propose an extension of our result to Bernstein-Sato polynomials for ideals and prove it for monomial ideals.

math.AG