Difference between revisions of "ApCoCoA-1:NC.LWIdeal"
From ApCoCoAWiki
m (Bot: Category moved) |
m (fixed links to namespace ApCoCoA) |
||
Line 23: | Line 23: | ||
</description> | </description> | ||
<seealso> | <seealso> | ||
− | <see>NC.GB</see> | + | <see>ApCoCoA-1:NC.GB|NC.GB</see> |
− | <see>NC.LW</see> | + | <see>ApCoCoA-1:NC.LW|NC.LW</see> |
− | <see>NC.SetOrdering</see> | + | <see>ApCoCoA-1:NC.SetOrdering|NC.SetOrdering</see> |
− | <see>Introduction to CoCoAServer</see> | + | <see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see> |
</seealso> | </seealso> | ||
<types> | <types> |
Revision as of 08:24, 7 October 2020
NC.LWIdeal
Leading word ideal of a finitely generated two-sided ideal in a non-commutative polynomial ring.
Syntax
Description
Proposition: Let I be a finitely generated two-sided ideal in a non-commutative polynomial ring K<x[1],...,x[n]>, and let Ordering be a word ordering on <x[1],...,x[n]>. If G is a Groebner basis of I with respect to Ordering. Then the leading word set LW{G}:={LW(g): g in G} is a generating system of the leading word ideal LW(I) with respect to Ordering.
Example
Use QQ[x,y,z,t]; NC.SetOrdering(<quotes>LLEX</quotes>); F1 := [[x^2], [-y,x]]; F2 := [[x,y], [-t,y]]; F3 := [[x,t], [-t,x]]; F4 := [[y,t], [-t,y]]; G := [F1,F2,F3,F4]; GB:=NC.GB(G); [NC.LW(E) | E In GB]; -- the leading word ideal of <G> w.r.t. the length-lexicographic word ordering [[y, t], [x, t], [x, y], [x^2], [t, y^2], [y^2, x]] -------------------------------
See also