ApCoCoA-1:BB.Box: Difference between revisions
From ApCoCoAWiki
KHiddemann (talk | contribs) fixing keys |
KHiddemann (talk | contribs) new alias |
||
| Line 1: | Line 1: | ||
<command> | <command> | ||
<title> | <title>BB.Box</title> | ||
<short_description>box order ideal</short_description> | <short_description>box order ideal</short_description> | ||
<syntax> | <syntax> | ||
BB.Box(D:LIST):LIST | |||
</syntax> | </syntax> | ||
<description> | <description> | ||
| Line 9: | Line 9: | ||
<example> | <example> | ||
Use Q[x,y,z]; | Use Q[x,y,z]; | ||
BB.Box([2,1,1]); | |||
[1, x] | [1, x] | ||
------------------------------- | ------------------------------- | ||
</example> | </example> | ||
</description> | </description> | ||
<see> | <see>BB.Border</see> | ||
<key>kreuzer</key> | <key>kreuzer</key> | ||
<key>bb.box</key> | |||
<key>borderbasis.box</key> | <key>borderbasis.box</key> | ||
<wiki-category>Package_borderbasis</wiki-category> | <wiki-category>Package_borderbasis</wiki-category> | ||
</command> | </command> | ||
Revision as of 19:45, 8 November 2007
BB.Box
box order ideal
Syntax
BB.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 the current term ordering.
Example
Use Q[x,y,z]; BB.Box([2,1,1]); [1, x] -------------------------------
