Hi,
I'd just add a function groebner_basis(F) to sage.libs.giac (or wherever the
Giac Cython interface lives) which takes a Sage sequence, computes a Gröbner
basis and returns a Sage sequence.
Integrating that into multi_polynomial_ideal.py is then very easy.
I've created
Agreed, I was just hoping someone else would do the work for me :)
On Monday 29 Jun 2015 14:59:15 Simon King wrote:
Hi Martin,
On 2015-06-29, 'Martin Albrecht' via sage-devel sage-
de...@googlegroups.com wrote:
Can we add a more convenient interface for computing Gröbner bases with
Sage.
Hi Martin,
On 2015-06-29, 'Martin Albrecht' via sage-devel sage-devel@googlegroups.com
wrote:
Can we add a more convenient interface for computing Gröbner bases with Sage.
That is, I'd like to be able to say
I.groebner_basis('giac')
and be done with it :) I'm happy to help.
If I
I can help also for the giacpy syntax.
We need 2 cases: only for grevlex, prime fields of char p 2^31 or QQ
(I think that in other cases giac could be very bad)
may be the easiest for me is if you could start a branch with those 2 cases
and some tags where I should insert the conversions and
I think I can start something it looks to be in
src/sage/rings/polynomial/multi_polynomial_ideal.py
http://git.sagemath.org/sage.git/tree/src/sage/rings/polynomial/multi_polynomial_ideal.py?id=c0e721783317f205106c9c3c552e366ce4e6c50e
It may not be necessary to modify the cython interface for
