# Difference between revisions of "ApCoCoA-1:BB.LiftND"

From ApCoCoAWiki

(Inserted example, updated "see" section) |
(Updated description) |
||

Line 1: | Line 1: | ||

<command> | <command> | ||

<title>BB.LiftND</title> | <title>BB.LiftND</title> | ||

− | <short_description>BBS generators from lifting of ND neighbors</short_description> | + | <short_description>BBS ideal generators from lifting of ND neighbors</short_description> |

<syntax> | <syntax> | ||

BB.LiftND(OO:LIST):LIST | BB.LiftND(OO:LIST):LIST | ||

</syntax> | </syntax> | ||

<description> | <description> | ||

− | + | Computes the generators of the border basis scheme ideal <formula>I(\mathbb{B}_\mathcal{O})</formula> that result from the lifting of next-door neighbors. The input is a list of terms OO (2nd element of type POLY). The output is a list of poly in the ring <formula>BBS=K[c_{ij}]</formula>. | |

<example> | <example> | ||

Use Q[x,y], DegRevLex; | Use Q[x,y], DegRevLex; |

## Revision as of 20:23, 29 July 2008

## BB.LiftND

BBS ideal generators from lifting of ND neighbors

### Syntax

BB.LiftND(OO:LIST):LIST

### Description

Computes the generators of the border basis scheme ideal <formula>I(\mathbb{B}_\mathcal{O})</formula> that result from the lifting of next-door neighbors. The input is a list of terms OO (2nd element of type POLY). The output is a list of poly in the ring <formula>BBS=K[c_{ij}]</formula>.

#### Example

Use Q[x,y], DegRevLex; BB.LiftND([Poly(1), x, y, xy]); [BBS :: c[1,2]c[2,1] + c[1,4]c[4,1] - c[1,3], BBS :: c[2,1]c[2,2] + c[2,4]c[4,1] + c[1,1] - c[2,3], BBS :: c[2,1]c[3,2] + c[3,4]c[4,1] - c[3,3], BBS :: c[2,1]c[4,2] + c[4,1]c[4,4] + c[3,1] - c[4,3], BBS :: c[1,1]c[3,2] + c[1,3]c[4,2] - c[1,4], BBS :: c[2,1]c[3,2] + c[2,3]c[4,2] - c[2,4], BBS :: c[3,1]c[3,2] + c[3,3]c[4,2] + c[1,2] - c[3,4], BBS :: c[3,2]c[4,1] + c[4,2]c[4,3] + c[2,2] - c[4,4]] -------------------------------