#13849: deprecate degrevlex when using PolyBoRi
---------------------------------------+------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.6
Component: commutative algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------------+------------------------------------
Comment (by PolyBoRi):
Of course I am biased, but I completely second the suggestion.
I would like to give a little bit background.
With ZDDs it's not possible to implement arbitrary monomial orderings
efficiently.
This is the reason why we have implemented only some orders which suffice
for
all most computations: lex., block, deglex, and degree reverse
lexicographical ordering ascending.
The ascending is there for a reason: It is exactly like degrevlex only
that x_1<x_2.
So, you have just to reverse variables (as malb explained) to get the same
behaviour.
Another aspect is that we deal in PolyBoRi functions with ZDDs and suppose
a certain behaviour.
This might result in wrong results, slow behaviour or other errors.
It's unfortunate that it does not seem feasible to have a compatibility
layer, but it's really difficult to have an interface that does both
expose all power and flexibility of PolyBoRi and at the same time pretends
that there is no library with very specific structures under the
interface.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13849#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
