next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
UnirationalBNSchemes
::
linkedDegree
linkedDegree -- computes the degree of the linked curve
Synopsis
Usage:
n=linkedDegree(g,d,F,G)
Inputs:
g
,
an
integer
, the genus of a curve
d
,
an
integer
, the degree of a curve
F
,
a
list
, a list of degree
G
,
a
list
, a list of degree
Outputs:
n
,
an
integer
, the degree of the linked curve to a curve of degree d and genus g, via a complete intersection defined by two forms of degrees F and G.
Description
i1 : linkedDegree(6,{5,5,5},{2,2,2},{2,2,2}) o1 = {3, 3, 3} o1 : List
Ways to use
linkedDegree
:
linkedDegree(ZZ,List,List,List)