On Tue, Nov 17, 2015 at 05:59:26AM -0800, Jean-Pierre Flori wrote:
> I'm sorry, but I have no clue what ecart is :)
> Though I spotted it was mentioned as the reason for this commit.
> So my question is now:
> how to get a polynomial degree using the original degree function used
> during the polynomial ring creation?
> Would using r->pFDegOrig be ok?
> (I'm sorry, I'm basically discovering Singular's internals while updating
> Singular in Sage.)
r->pFDeg : the degree of the leading monomial, compatible with the
r->pLDeg : the maximal degree (and the length) of a polynomial,
usable for ecart
p_WDegree/pWDegree: degree of the leading monomial wrt. the current
weights, total degree for lex. orderings
p_Deg/pDeg: degree of the leading monomial wrt. the current weights
p_Totaldegree/pTotaldegree: degree of the leading monomial wrt. weight 1
Remark: ecart:=max degree - degree of leading term,
used for non-global orderings (i.e. algorithm of Mora)