Difference between revisions of "ApCoCoA-1:BB.GenMultMat"
From ApCoCoAWiki
Line 2: | Line 2: | ||
<title>BB.GenMultMat</title> | <title>BB.GenMultMat</title> | ||
<short_description>Compute a generic multiplication matrix.</short_description> | <short_description>Compute a generic multiplication matrix.</short_description> | ||
− | <syntax>BB.GenMultMat(I:INT,OO:LIST):MAT</syntax> | + | |
+ | <syntax> | ||
+ | BB.GenMultMat(I:INT,OO:LIST):MAT | ||
+ | </syntax> | ||
<description> | <description> | ||
Computes the generic multiplication matrix for x[I] with respect to an order ideal. The inputs are an integer I and a list OO of terms that specify an order ideal. The second element of OO must be a non-constant polynomial. The output is a matrix of size <ref>Len</ref>(OO) x <ref>Len</ref>(OO) over the ring BBS=K[c_{ij}]. | Computes the generic multiplication matrix for x[I] with respect to an order ideal. The inputs are an integer I and a list OO of terms that specify an order ideal. The second element of OO must be a non-constant polynomial. The output is a matrix of size <ref>Len</ref>(OO) x <ref>Len</ref>(OO) over the ring BBS=K[c_{ij}]. |
Revision as of 14:46, 24 April 2009
BB.GenMultMat
Compute a generic multiplication matrix.
Syntax
BB.GenMultMat(I:INT,OO:LIST):MAT
Description
Computes the generic multiplication matrix for x[I] with respect to an order ideal. The inputs are an integer I and a list OO of terms that specify an order ideal. The second element of OO must be a non-constant polynomial. The output is a matrix of size Len(OO) x Len(OO) over the ring BBS=K[c_{ij}].
@param I The generic ultiplication matrix for the indeterminate x[I] will be computed.
@param OO A list of terms representing an order ideal.
@return The generic multiplication matrix for the indeterminate x[I] over the ring BBS=K[c_{ij}].