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

From ApCoCoAWiki
Line 2: Line 2:
 
   <title>BB.NDneighbors</title>
 
   <title>BB.NDneighbors</title>
 
   <short_description>Compute a list of next-door neighbors.</short_description>
 
   <short_description>Compute a list of next-door neighbors.</short_description>
   <syntax>BB.NDneighbors(OO:LIST):LIST</syntax>
+
    
 +
<syntax>
 +
BB.NDneighbors(OO:LIST):LIST
 +
</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.
 
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.

Revision as of 14:51, 24 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 [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