Difference between revisions of "ApCoCoA-1:Weyl.WMul"

From ApCoCoAWiki
(trying to fix this.)
(fixed formula tag)
Line 9: Line 9:
 
This function computes a Groebner Basis for an ideal in a Weyl Algebra. It is currently completely independent from the other methods of package Weyl and does NOT use its data types.  
 
This function computes a Groebner Basis for an ideal in a Weyl Algebra. It is currently completely independent from the other methods of package Weyl and does NOT use its data types.  
  
The input is an ideal in a ring, having 2n indeterminates. The last n indeterminates are assumed to be the derivatives. All polynomails are assumed to be in their normal form with respect to the indeterminates' commutators, e.g. all <formula>x_i </formula> are in front of all <formula \partial_i </formula>, so the  'normal' CoCoA polynomials can be (and are) used to store the weyl polynomials. The output is again a list of polynomials in a normal ring, containing the Weyl-GBasis polynomials in their normal forms.
+
The input is an ideal in a ring, having 2n indeterminates. The last n indeterminates are assumed to be the derivatives. All polynomails are assumed to be in their normal form with respect to the indeterminates' commutators, e.g. all <formula>x_i </formula> are in front of all <formula>\partial_i</formula>, so the  'normal' CoCoA polynomials can be (and are) used to store the weyl polynomials. The output is again a list of polynomials in a normal ring, containing the Weyl-GBasis polynomials in their normal forms.
  
 
This implementation is not the final one, but currently due to requests enabled. In a later stage, the packages  data types should be used.
 
This implementation is not the final one, but currently due to requests enabled. In a later stage, the packages  data types should be used.

Revision as of 16:14, 20 March 2008

Weyl.GBasis

computing a Groebner basis in a weyl algebra.

Syntax

Weyl.GBasis(I):LIST

Description


This function computes a Groebner Basis for an ideal in a Weyl Algebra. It is currently completely independent from the other methods of package Weyl and does NOT use its data types.

The input is an ideal in a ring, having 2n indeterminates. The last n indeterminates are assumed to be the derivatives. All polynomails are assumed to be in their normal form with respect to the indeterminates' commutators, e.g. all <formula>x_i </formula> are in front of all <formula>\partial_i</formula>, so the 'normal' CoCoA polynomials can be (and are) used to store the weyl polynomials. The output is again a list of polynomials in a normal ring, containing the Weyl-GBasis polynomials in their normal forms.

This implementation is not the final one, but currently due to requests enabled. In a later stage, the packages data types should be used.

See also

Weyl.WeylIdeal

Weyl.WeylPolynom

Weyl.NewWeylIdeal