1994
DOI: 10.1016/0019-3577(94)90022-1
|View full text |Cite
|
Sign up to set email alerts
|

The primitive length of a general k-gonal curve

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
22
0

Year Published

1995
1995
2002
2002

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 28 publications
(22 citation statements)
references
References 7 publications
0
22
0
Order By: Relevance
“…Since it is simple again it cannot be of type 1. Thus, according to [CKM2,4.2] we conclude that its Clifford index is at least g−2 2 , and so 2d ≥ g + 4r − 2 + 2i ≥ g + 4r − 2.…”
Section: 3mentioning
confidence: 84%
See 3 more Smart Citations
“…Since it is simple again it cannot be of type 1. Thus, according to [CKM2,4.2] we conclude that its Clifford index is at least g−2 2 , and so 2d ≥ g + 4r − 2 + 2i ≥ g + 4r − 2.…”
Section: 3mentioning
confidence: 84%
“…For k ≥ 3 and r = 1 there is the following existence theorem ( [CKM2]): On the general k -gonal curve C (k ≥ 3) there are non -trivial pencils g 1 d of degree d > k if and only if g+1 2 < d < g. Note that this bound is slightly different from that of Proposition 1.16 for r = 1. If k ≥ 3 and r = 2, however, B. Segre ( [S]; see also [AC]) proved that the inequalities in Proposition 1.16 are also sufficient for the existence of type 3 -nets on the general k -gonal curve.…”
Section: 3mentioning
confidence: 99%
See 2 more Smart Citations
“…Theorem 0.1 is easy to use both for curves with general moduli and for curves for which the classical theory of special divisor is known. The interested reader may see the case of plane curves in [5]. The proof of 0.1 uses a construction (see 1.1) made in [2] for the same purpose.…”
Section: Introductionmentioning
confidence: 99%