×

Group law on the intersection of two quadrics. (English) Zbl 0457.14023


MSC:

14M10 Complete intersections
51A20 Configuration theorems in linear incidence geometry
51M35 Synthetic treatment of fundamental manifolds in projective geometries (Grassmannians, Veronesians and their generalizations)
14M15 Grassmannians, Schubert varieties, flag manifolds
14J40 \(n\)-folds (\(n>4\))
PDFBibTeX XMLCite
Full Text: Numdam EuDML

References:

[1] N. Bourbaki , Formes sesquilinéaire et formes quadratiques , Eléments de Math. , 24 , Actualités Sci. Industr. , Paris , Hermann , 1959 . MR 107661 | Zbl 0102.25503 · Zbl 0102.25503
[2] H. Clemens - P. Griffiths , The intermediate Jacobian of the cubic threefold , Ann. of Math. , 95 ( 1972 ), pp. 281 - 356 . MR 302652 | Zbl 0214.48302 · Zbl 0214.48302 · doi:10.2307/1970801
[3] R. Donagi , On the geometry of Grassmannians , Duke Math. J. , 44 ( 1977 ), pp. 795 - 837 . Article | MR 572991 | Zbl 0377.14010 · Zbl 0377.14010 · doi:10.1215/S0012-7094-77-04436-2
[4] P. Griffiths - J. Harris , Algebraic Geometry , John Wiley , New York (to appear). · Zbl 0559.14017
[5] W.V.D. Hodge - D. Pedoe , Methods of algebraic geometry , Cambridge University Press , 1954 . MR 61846 · Zbl 0055.38705
[6] M.S. Narasimhan - S. Ramanan , Moduli of vector bundles on a compact Riemann surface , Ann. of Math. , 89 ( 1969 ), pp. 14 - 51 . MR 242185 | Zbl 0186.54902 · Zbl 0186.54902 · doi:10.2307/1970807
[7] M. Reid , Cambridge Thesis , June 1972 , unpublished.
[8] A.N. Tyurin , On intersections of quadrics , Russian Math. Surveys , 30 , no. 6 ( 1975 ), pp. 51 - 105 . MR 424833 | Zbl 0339.14020 · Zbl 0339.14020 · doi:10.1070/RM1975v030n06ABEH001530
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.