ApCoCoA-1:BB.Box: Difference between revisions
From ApCoCoAWiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
<command> | <command> | ||
<title>BB.Box</title> | <title>BB.Box</title> | ||
<short_description> | <short_description>Computes a box order ideal.</short_description> | ||
<syntax> | <syntax> | ||
| Line 21: | Line 21: | ||
<types> | <types> | ||
<type>borderbasis</type> | <type>borderbasis</type> | ||
<type>ideal</type> | |||
</types> | </types> | ||
<see>BB.Border</see> | <see>BB.Border</see> | ||
Revision as of 12:42, 28 April 2009
BB.Box
Computes 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] -------------------------------
