Home Online Manual
Back: intersectionValRings
Forward: showNuminvs
Up: normaliz_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.4.19.10 intersectionValRingIdeals

Procedure from library normaliz.lib (see normaliz_lib).

intersectionValRingIdeals(intmat V);
intersectionValRingIdeals(intmat V, intvec grading);

The function returns two ideals, both to be considered as lists of monomials. The first is the system of monomial generators of $S$, the second the system of generators of $M$.
The function returns a list consisting of the ideal given by the input matrix T if one of the options supp, triang, or hvect has been activated. However, in this case some numerical invariants are computed, and some other data may be contained in files that you can read into Singular (see showNuminvs, exportNuminvs).

A discrete monomial valuation $v$ on $R = K[X_1 ,\ldots,X_n]$ is determined by the values $v(X_j)$ of the indeterminates. This function computes the subalgebra $S = \{ f \in R : v_i ( f ) \geq 0,\ i = 1,\ldots,r\}$ for several such valuations $v_i$, $i=1,\ldots,r$. It needs the matrix $V = (v_i(X_j))$ as its input.

This function simultaneously determines the $S$-submodule $M = \{ f \in R : v_i(f) \geq w_i ,\ i = 1,\ldots,r\}$ for integers $w_1,\ldots\,w_r$. (If $w_i \geq 0$ for all $i$, $M$ is an ideal of $S$.) The numbers $w_i$ form the $(n+1)$th column of the input matrix.

The function also gives an error message if the matrix V has the wrong number of columns.

LIB "normaliz.lib";
ring R=0,(x,y,z,w),dp;
intmat V[2][5]=0,1,2,3,4, -1,1,2,1,3;
==> [1]:
==>    _[1]=w
==>    _[2]=z
==>    _[3]=y
==>    _[4]=xw
==>    _[5]=xz
==>    _[6]=xy
==>    _[7]=x2z
==> [2]:
==>    _[1]=w3
==>    _[2]=zw
==>    _[3]=z2
==>    _[4]=yw2
==>    _[5]=y2w
==>    _[6]=y2z
==>    _[7]=y4
==>    _[8]=xz2
==>    _[9]=xy2z
==>    _[10]=xy4
See also: diagInvariants; finiteDiagInvariants; intersectionValRings; torusInvariants.