×

zbMATH — the first resource for mathematics

Free linear systems on integral Gorenstein curves. (English) Zbl 0770.14002
One introduces and studies the notion of free linear systems on Gorenstein curves, designated to play a similar role as that of base point free linear systems on smooth curves. In particular one proves a “free pencil trick”. – Some applications to integral plane curves are indicated.

MSC:
14C20 Divisors, linear systems, invertible sheaves
14M05 Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal)
14H45 Special algebraic curves and curves of low genus
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Arbarello, E; Cornalba, M; Griffiths, P.A; Harris, J, Geometry of algebraic curves, () · Zbl 0559.14017
[2] Coppens, M, The Weierstrass gap sequence of the ordinary ramification points of trigonal coverings of P1; existence of a kind of Weierstrass gap sequence, J. pure appl. algebra, 43, 11-25, (1986) · Zbl 0616.14012
[3] \scM. Coppens, Linear systems on smooth plane curves, in preparation. · Zbl 0842.14020
[4] \scM. Coppens and T. Kato, Work in progress.
[5] Hartshorne, R, Algebraic geometry, () · Zbl 0532.14001
[6] Hartshorne, R, Generalized divisors on Gorenstein curves and a theorem of Noether, J. math. Kyoto univ., 26, 375-386, (1986) · Zbl 0613.14008
[7] Homma, M, Funny plane curves in characteristic p > 0, Comm. algebra, 15, 1469-1501, (1987) · Zbl 0623.14014
[8] Kleiman, S, r-special subschemes and an argument of Severi’s, Adv. in math., 22, 1-23, (1976) · Zbl 0342.14012
[9] Serre, J.-P, Groupes algébriques et corps de classes, (1959), Hermann Paris · Zbl 0097.35604
[10] Tannenbaum, A, Families of algebraic curves with nodes, Compositio math., 41, 107-119, (1980) · Zbl 0399.14018
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.