Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-19T06:31:00.029Z Has data issue: false hasContentIssue false

Bend, break and count II: elliptics, cuspidals, linear genera

Published online by Cambridge University Press:  01 July 1999

Z. RAN
Affiliation:
Department of Mathematics, University of California, Riverside, Riverside, CA 92521 USA; e-mail: ziv@math.ucr.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In [R2] we showed how elementary considerations involving geometry on ruled surfaces may be used to obtain recursive enumerative formulae for rational plane curves. Here we show how similar considerations may be used to obtain further enumerative formulae, as follow. First some notation. As usual we denote by Ngd the number of irreducible plane curves of degree d and genus g through 3d+g−1 general points. Also, we denote by Ngd→ (resp. Ngd×) the number of such curves passing through general points A1, …, A3d+g−2 and having a given tangent direction (resp. a node) at A1. As is well known and easy to see, we have

formula here

For any d, g, these numbers are computed in [R1] as part of a more general recursive procedure. For N0d, N1d, relatively simple recursions have been given by Kontsevich–Manin (see [FP]) and Eguchi–Hori–Xiong–Getzler (see [P1]), respectively.

Information

Type
Research Article
Copyright
The Cambridge Philosophical Society 1999