#11667: Cache groebner basis independend of degree bound
--------------------------------------------------------------------------------------------+
Reporter: vbraun
| Owner: malb
Type: enhancement
| Status: needs_work
Priority: major
| Milestone: sage-4.7.2
Component: commutative algebra
| Keywords:
Work_issues: Error prone computations may be done explicitly, but must not be
the default | Upstream: N/A
Reviewer: Simon King
| Author: Volker Braun
Merged:
| Dependencies:
--------------------------------------------------------------------------------------------+
Comment(by john_perry):
It seems to me that "truncated Gröbner basis" ''is'' a correct term for
this, at least in the inhomogeneous case. See, for example, Definition 2.8
of "A new efficient algorithm for computing Gröbner bases (F4)" by J-C
Faugére, Journal of Pure and Applied Algebra, vol 139 (1999) 61-88. In the
homogeneous case, it is called a "degree d" Gröbner basis.
I'm not aware of "partial" or "incomplete" Gröbner basis in the
literature, though perhaps they exist.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11667#comment:5>
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.
