zbMATH — the first resource for mathematics

On the enumerative geometry of real algebraic curves having many real branches. (English) Zbl 1019.14021
Given a real plane curve of degree \(d\) and genus \(g\geq 1\), having at least \(g\) real banches (connected components of the normalization), the author gives a formula for the number of real plane curves of degree \(d-1\), which cross each real branch of the given curve at one point and with a prescribed multiplicity. A similar statement is proven for real space curves. The idea is close to that suggested in the previous author’s work [Ill. J. Math. 46, 145-153 (2002; Zbl 1007.14011)]. The enumeration of curves is reduced to the count of specific subgroups in the real part of \(\text{Pic}(C)\). The results are illustrated by a number of examples.
14N10 Enumerative problems (combinatorial problems) in algebraic geometry
14H50 Plane and space curves
14P25 Topology of real algebraic varieties
Full Text: DOI EuDML
[1] W. Fulton, Introduction to intersection theory in algebraic geometry. Reg. Conf. Ser. Math. 54, Amer. Math. Soc. 1996. · Zbl 0913.14001
[2] Math. Ann. 10 (1876) pp 189–
[3] R. Hartshorne, Algebraic geometry.Springer 1977. · Zbl 0367.14001
[4] J. Huisman, On the neutral component of the Jacobian of a real algebraic curve having many components. Indag. Math. (N.S.) 12 (2001), 73-81. · Zbl 1014.14027
[5] N. M. Katz, B. Mazur, Arithmetic moduli of elliptic curves. Princeton Univ. Press 1985. · Zbl 0576.14026
[6] Ronga A., Rev. Mat. Univ. Complut. Madrid 10 pp 391– (1997)
[7] J. H. Silverman, The arithmetic of elliptic curves. Springer 1986. · Zbl 0585.14026
[8] Duke Math. J. 87 pp 59– (1997)
[9] F. Sottile, Enumerative real algebraic geometry. Preprint 2001. · Zbl 1081.14080
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.