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

From ApCoCoAWiki
Line 7: Line 7:
 
</syntax>
 
</syntax>
 
   <description>
 
   <description>
Computes the list of next-door neighbors in the border of the order ideal OO. The input is a list OO of terms that specify an order ideal. The output is a list of triples [i,j,k] such that b_i = x_k * b_j.
+
This command computes the list of next-door neighbors in the border of the order ideal <tt>OO</tt>. The input is a list <tt>OO</tt> of terms that specify an order ideal. The output is a list of triples <tt>[i,j,k]</tt> such that <tt>b_i = x_k * b_j</tt>.
 
<itemize>
 
<itemize>
 
   <item>@param <em>OO</em> A list of terms representing an order ideal.</item>
 
   <item>@param <em>OO</em> A list of terms representing an order ideal.</item>
   <item>@return A list of next-door neighbors of OO.</item>
+
   <item>@return A list of next-door neighbors of <tt>OO</tt>.</item>
 
</itemize>
 
</itemize>
 
<example>
 
<example>

Revision as of 15:50, 8 July 2009

BB.NDneighbors

Computes a list of next-door neighbors.

Syntax

BB.NDneighbors(OO:LIST):LIST

Description

This command computes the list of next-door neighbors in the border of the order ideal OO. The input is a list OO of terms that specify an order ideal. The output is a list of triples [i,j,k] such that b_i = x_k * b_j.

  • @param OO A list of terms representing an order ideal.

  • @return A list of next-door neighbors of OO.

Example

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

BB.ASneighbors