next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
SymbolicPowers :: containmentProblem

containmentProblem -- computes the smallest symbolic power contained in a power of an ideal.

Synopsis

Description

Given an ideal I and an integer n, containementProblem returns the order of the smallest symbolic power of I contained in In.

i1 : B = QQ[x,y,z];
i2 : f = map(QQ[t],B,{t^3,t^4,t^5})

                   3   4   5
o2 = map(QQ[t],B,{t , t , t })

o2 : RingMap QQ[t] <--- B
i3 : I = ker f;

o3 : Ideal of B
i4 : m = containmentProblem(I,2)

o4 = 3

See also

Ways to use containmentProblem :