Difference between revisions of "ApCoCoA-1:BB.Box"

From ApCoCoAWiki
Line 2: Line 2:
 
   <title>BB.Box</title>
 
   <title>BB.Box</title>
 
   <short_description>Compute a box order ideal.</short_description>
 
   <short_description>Compute a box order ideal.</short_description>
   <syntax>BB.Box(D:LIST):LIST</syntax>
+
    
 +
<syntax>
 +
BB.Box(D:LIST):LIST
 +
</syntax>
 
   <description>
 
   <description>
 
Computes the box order ideal of type D=[D_1,..,D_N]. The input is a list of integers D of length <ref>NumIndets</ref>(). The output is a list of terms sorted in ascending order with respect to the current term ordering.
 
Computes the box order ideal of type D=[D_1,..,D_N]. The input is a list of integers D of length <ref>NumIndets</ref>(). The output is a list of terms sorted in ascending order with respect to the current term ordering.

Revision as of 14:45, 24 April 2009

BB.Box

Compute a box order ideal.

Syntax

BB.Box(D:LIST):LIST

Description

Computes the box order ideal of type D=[D_1,..,D_N]. The input is a list of integers D of length NumIndets(). The output is a list of terms sorted in ascending order with respect to the current term ordering.

  • @param D List of integer values representing an exponent vector of a term. The order ideal spanned by the term represented by this exponent vector will be computed.

  • @return A list of terms of the order ideal spanned by the term represented by the exponent vector D, sorted in ascending order w.r.t. the current term ordering.

Example

Use QQ[x,y,z];
BB.Box([2,1,1]);
[1, x]
-------------------------------

BB.Border