next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
K3Carpets :: computeBound

computeBound -- compute the bound for the good types in case of k resonance

Synopsis

Description

The iterated mapping over the relative resolution of Xe(a,b) in the resonance scroll has betti numbers in a range of a general 2k-gonal canonical curve of genus a+b+1, if a,b are large enough, see ES2018. We compute the minimal type (a,b) ≡(a1,b1) modk where this becomes true.

In the second version c is the minimal value of a,b’s for all congruence classes mod k. We conjecture that c=k2-k.

i1 : (a,b)=computeBound(6,4,3)

o1 = (9, 7)

o1 : Sequence
i2 : computeBound 3
     -- 0.132983 seconds elapsed
     -- 0.0863485 seconds elapsed
     -- 0.0903532 seconds elapsed
     -- 0.121876 seconds elapsed
     -- 0.0959876 seconds elapsed
     -- 0.132677 seconds elapsed

o2 = 6

See also

Ways to use computeBound :