next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
MonomialMultiplierIdeals :: monomialThreshold

monomialThreshold -- thresholds of multiplier ideals of monomial ideals

Synopsis

Description

Computes the threshold of inclusion of the monomial m=x^v in the multiplier ideal J(I^t), that is, the value t = sup{ c | m lies in J(I^c) } = min{ c | m does not lie in J(I^c)}. In other words, (1/t)*(v+(1,..,1)) lies on the boundary of the Newton polyhedron Newt(I). In addition, returns the linear inequalities for those facets of Newt(I) which contain (1/t)*(v+(1,..,1)). These are in the format of Normaliz, i.e., a matrix (A | b) where the number of columns of A is the number of variables in the ring, b is a column vector, and the inequality on the column vector v is given by Av+b >= 0, entrywise. As a special case, the log canonical threshold is the threshold of the monomial 1_R = x^0.
i1 : R = QQ[x,y];
i2 : I = monomialIdeal(x^13,x^6*y^4,y^9);

o2 : MonomialIdeal of R
i3 : monomialThreshold(I,x^2*y)

      1
o3 = (-, | 5 6 -54 |)
      2  | 4 7 -52 |

o3 : Sequence

See also

Ways to use monomialThreshold :