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

From ApCoCoAWiki
(Short description update.)
(Added parameter and return value list.)
Line 7: Line 7:
 
     <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 <formula>[i,j,k]</formula> such that <formula>b_i = x_k * b_j</formula>.
 
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 <formula>[i,j,k]</formula> such that <formula>b_i = x_k * b_j</formula>.
 +
<itemize>
 +
  <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>
 +
</itemize>
 
<example>
 
<example>
 
Use Q[x,y,z];
 
Use Q[x,y,z];

Revision as of 16:23, 22 April 2009

BB.NDneighbors

Compute a list of next-door neighbors.

Syntax

BB.NDneighbors(OO:LIST):LIST

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 <formula>[i,j,k]</formula> such that <formula>b_i = x_k * b_j</formula>.

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

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

Example

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

BB.ASneighbors