QEtaGroebner(C, E)ΒΆ
qetatool.spad line 335 [edit on github]
C: GcdDomain
E: OrderedAbelianMonoidSup with
directProduct: Vector NonNegativeInteger -> %
members: % -> List NonNegativeInteger
QEtaGroebner(C
, E
) is a wrapper around the GrobnerPackage. It basically converts given polynomials to elements in PolynomialRing(C
, E
), does some Groebner basis computation or reduction and then converts back.
- extendedNormalForm: (Polynomial C, List Polynomial C, List Symbol, Symbol, List Symbol) -> Polynomial C
extendedNormalForm(pol, gb, syms, f, gsyms)
reducespol
with respect togb
and returns that reduced polynomial together with its relations in terms ofgb
. The original polynomial is represented by the variablef
and the Groebner basis elements by the variables gsyms. We assume that each of the polynomialspol
andgb
is indeed a polynomial insyms
(and no other variables) and thatE
corresponds to exactly #syms variables.
- extendedNormalForm: (Polynomial C, List Polynomial C, List Symbol, Symbol, String) -> Polynomial C
extendedNormalForm(pol, gb, syms, f, g)
returns extendedNormalForm(pol
,gb
,syms
,f
, gsyms) for gsyms:=
indexedSymbols(g
,\#gb
).
- extendedNormalForms: (List Polynomial C, List Polynomial C, List Symbol, String, String) -> List Polynomial C
extendedNormalForms(lpol, gb, syms, f, g)
returns [extendedNormalForm(p
,gb
,syms
,f
,g
) forp
inlpol
forf
in indexedSymbols(f
, #lpol)]
- groebner: (List Polynomial C, List Symbol) -> List Polynomial C
groebner(lpol, syms)
considers the list of polynomials as polynomials in syms, and computes a Groebner basis with respect to the order given byE
. We assume that each of the polynomials inlpol
is indeed a polynomial in syms (and no other variables) and thatE
corresponds to exactly #syms variables.
- groebnerExtend: (List Polynomial C, List Polynomial C, List Symbol) -> List Polynomial C
groebnerExtend(lpol, gb, syms)
computes a Groebner basis of the union of lpos andgb
under the assumption thatgb
is already a Groebner basiswrt
. the order given byE
. We assume that each of the polynomials inlpol
andgb
is indeed a polynomial in syms (and no other variables) and thatE
corresponds to exactly #syms variables.
- normalForms: (List Polynomial C, List Polynomial C, List Symbol) -> List Polynomial C
normalForms(lpol, gb, syms)
reduces each polynomial fromlpol
with respect to the Groebner basis given bygb
. We assume that each of the polynomials inlpol
andgb
is indeed a polynomial in syms (and no other variables) and thatE
corresponds to exactly #syms variables.