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

From ApCoCoAWiki
(Description update.)
(Corrected example. (Skaspar))
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 
<command>
 
<command>
 
   <title>BB.Box</title>
 
   <title>BB.Box</title>
   <short_description>Compute a box order ideal.</short_description>
+
   <short_description>Computes 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 <tt>D=[D_1,..,D_N]</tt>. The input is a list of integers <tt>D</tt> of length <ref>NumIndets</ref>(). The output is a list of terms sorted in ascending order with respect to the current term ordering.
 
<itemize>
 
<itemize>
 
   <item>@param <em>D</em> 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.</item>
 
   <item>@param <em>D</em> 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.</item>
   <item>@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.</item>
+
   <item>@return A list of terms of the order ideal spanned by the term represented by the exponent vector <tt>D</tt>, sorted in ascending order w.r.t. the current term ordering.</item>
 
</itemize>
 
</itemize>
 
<example>
 
<example>
 
Use QQ[x,y,z];
 
Use QQ[x,y,z];
 
BB.Box([2,1,1]);
 
BB.Box([2,1,1]);
[1, x]
+
 
 +
[1, z, y, x, yz, xz, xy, x^2, xyz, x^2z, x^2y, x^2yz]
 
-------------------------------
 
-------------------------------
 
</example>
 
</example>
 
   </description>
 
   </description>
 
   <types>
 
   <types>
     <type>list</type>
+
     <type>borderbasis</type>
 +
    <type>ideal</type>
 
   </types>
 
   </types>
 
   <see>BB.Border</see>
 
   <see>BB.Border</see>
 +
 
   <key>Box</key>
 
   <key>Box</key>
 
   <key>BB.Box</key>
 
   <key>BB.Box</key>

Revision as of 23:30, 31 March 2011

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, z, y, x, yz, xz, xy, x^2, xyz, x^2z, x^2y, x^2yz]
-------------------------------

BB.Border