ApCoCoA-1:BB.NDneighbors: Difference between revisions

From ApCoCoAWiki
KHiddemann (talk | contribs)
fixing keys
KHiddemann (talk | contribs)
new alias
Line 1: Line 1:
<command>
<command>
     <title>borderbasis.NDneighbors</title>
     <title>BB.NDneighbors</title>
     <short_description>list of next-door neighbors</short_description>
     <short_description>list of next-door neighbors</short_description>
<syntax>
<syntax>
$borderbasis.NDneighbors(OO:LIST):LIST
BB.NDneighbors(OO:LIST):LIST
</syntax>
</syntax>
     <description>
     <description>
Line 9: Line 9:
<example>
<example>
Use Q[x,y,z];
Use Q[x,y,z];
$borderbasis.NDneighbors([1,x]);
BB.NDneighbors([1,x]);
[[3, 1, 1], [4, 2, 1]]
[[3, 1, 1], [4, 2, 1]]
-------------------------------
-------------------------------
</example>
</example>
     </description>
     </description>
     <see>borderbasis.ASneighbors</see>
     <see>BB.ASneighbors</see>
     <key>kreuzer</key>
     <key>kreuzer</key>
    <key>bb.ndneighbors</key>
     <key>borderbasis.ndneighbors</key>
     <key>borderbasis.ndneighbors</key>
     <wiki-category>Package_borderbasis</wiki-category>
     <wiki-category>Package_borderbasis</wiki-category>
</command>
</command>

Revision as of 19:52, 8 November 2007

BB.NDneighbors

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>.

Example

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

BB.ASneighbors