Difference between revisions of "Package sagbi/SB.SAGBI"
From ApCoCoAWiki
Andraschko (talk | contribs) (added version info) |
Andraschko (talk | contribs) m (grammar) |
||
| (8 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | {| | + | {{Version|2|[[ApCoCoA-1:SB.Sagbi]] and [[ApCoCoA-1:SB.ReducedSagbi]]}} |
| − | | | ||
| − | |||
| − | |||
<command> | <command> | ||
<title>SB.SAGBI</title> | <title>SB.SAGBI</title> | ||
<short_description>Computes a finite SAGBI-basis of a subalgebra if existing.</short_description> | <short_description>Computes a finite SAGBI-basis of a subalgebra if existing.</short_description> | ||
| − | + | ||
| − | <syntax> | + | <syntax>SB.SAGBI(G:LIST of POLY):LIST of POLY</syntax> |
| − | SB.SAGBI(G:LIST of POLY):LIST of POLY | ||
| − | </syntax> | ||
<description> | <description> | ||
| − | This function computes a finite SAGBI-basis of a subalgebra <tt>S</tt> generated by the polynomials of the list <tt>G</tt>, if a finite SAGBI-basis of <tt>S</tt> | + | This function computes a finite SAGBI-basis of a subalgebra <tt>S</tt> generated by the polynomials of the list <tt>G</tt>, if a finite SAGBI-basis of <tt>S</tt> exists. Then a list of polynomials is returned which form a SAGBI-basis of <tt>S</tt>. Otherwise the computation runs until it is interrupted. |
| − | <itemize> | + | <itemize> |
| − | + | <item>@param <em>G</em> A list of polynomials which generates a subalgebra.</item> | |
| − | + | <item>@return A list of polynomials which form a finite SAGBI-basis of the subalgebra generated by <tt>G</tt>.</item> | |
| − | </itemize> | + | </itemize> |
| − | <example> | + | <example> |
| − | Use QQ[x | + | Use QQ[x,y,z], DegRevLex; |
| − | S := SB.SAGBI([x | + | S := SB.SAGBI([x^2 -z^2, x*y +z^2, y^2 -2*z^2]); |
indent(S); | indent(S); | ||
| − | ---- | + | -- [ |
| − | + | -- y^2 -2*z^2, | |
| − | + | -- x*y +z^2, | |
| − | x | + | -- x^2 -z^2, |
| − | x | + | -- x^2*z^2 +x*y*z^2 +(1/2)*y^2*z^2 +(-1/2)*z^4 |
| − | x | + | -- ]</example> |
| − | ] | ||
| − | </example> | ||
</description> | </description> | ||
| − | < | + | |
| − | < | + | <seealso> |
| + | <see>Package sagbi/SB.TruncSAGBI</see> | ||
| + | <see>Package sagbi/SB.SAGBITimeout</see> | ||
| + | <see>Package sagbi/SB.IsSAGBIOf</see> | ||
| + | <see>Package sagbi/SB.GetSAGBI</see> | ||
| + | <see>Package sagbi/SB.GetTruncSAGBI</see> | ||
| + | </seealso> | ||
| + | |||
<types> | <types> | ||
<type>sagbi</type> | <type>sagbi</type> | ||
<type>poly</type> | <type>poly</type> | ||
</types> | </types> | ||
| − | <key> | + | |
| − | <key> | + | <key>SAGBI</key> |
| − | <key>sagbi. | + | <key>SB.SAGBI</key> |
| − | <wiki-category> | + | <key>apcocoa/sagbi.SAGBI</key> |
| + | |||
| + | <wiki-category>Package sagbi</wiki-category> | ||
</command> | </command> | ||
Latest revision as of 15:56, 9 February 2021
| This article is about a function from ApCoCoA-2. If you are looking for the ApCoCoA-1 version of it, see ApCoCoA-1:SB.Sagbi and ApCoCoA-1:SB.ReducedSagbi. |
SB.SAGBI
Computes a finite SAGBI-basis of a subalgebra if existing.
Syntax
SB.SAGBI(G:LIST of POLY):LIST of POLY
Description
This function computes a finite SAGBI-basis of a subalgebra S generated by the polynomials of the list G, if a finite SAGBI-basis of S exists. Then a list of polynomials is returned which form a SAGBI-basis of S. Otherwise the computation runs until it is interrupted.
@param G A list of polynomials which generates a subalgebra.
@return A list of polynomials which form a finite SAGBI-basis of the subalgebra generated by G.
Example
Use QQ[x,y,z], DegRevLex; S := SB.SAGBI([x^2 -z^2, x*y +z^2, y^2 -2*z^2]); indent(S); -- [ -- y^2 -2*z^2, -- x*y +z^2, -- x^2 -z^2, -- x^2*z^2 +x*y*z^2 +(1/2)*y^2*z^2 +(-1/2)*z^4 -- ]
See also
Package sagbi/SB.GetTruncSAGBI
