Difference between revisions of "ApCoCoA-1:BB.Box"
From ApCoCoAWiki
KHiddemann (talk | contribs) m |
(Reviewed text and added example) |
||
| Line 1: | Line 1: | ||
<command> | <command> | ||
<title>borderbasis.Box</title> | <title>borderbasis.Box</title> | ||
| − | <short_description | + | <short_description>box order ideal</short_description> |
<syntax> | <syntax> | ||
$borderbasis.Box(D:LIST):LIST | $borderbasis.Box(D:LIST):LIST | ||
</syntax> | </syntax> | ||
<description> | <description> | ||
| − | Computes the | + | Computes the box order ideal of type <formula>D=[D_1,..,D_N]</formula>. The input is a list of integers D of length NumIndets(). The output is a list of terms sorted with respect to current term ordering. |
| + | <example> | ||
| + | Use Q[x,y,z]; | ||
| + | $borderbasis.Box([2,1,1]); | ||
| + | [1, x] | ||
| + | ------------------------------- | ||
| + | </example> | ||
</description> | </description> | ||
| + | <see>borderbasis.Border</see> | ||
<key>Kreuzer</key> | <key>Kreuzer</key> | ||
<key>borderbasis.box</key> | <key>borderbasis.box</key> | ||
Revision as of 23:12, 7 November 2007
borderbasis.Box
box order ideal
Syntax
$borderbasis.Box(D:LIST):LIST
Description
Computes the box order ideal of type <formula>D=[D_1,..,D_N]</formula>. The input is a list of integers D of length NumIndets(). The output is a list of terms sorted with respect to current term ordering.
Example
Use Q[x,y,z]; $borderbasis.Box([2,1,1]); [1, x] -------------------------------
