On Wednesday, 12 December 2012 02:28:19 UTC, kcrisman wrote:
On Tuesday, December 11, 2012 6:52:53 PM UTC-5, JamesHDavenport wrote:
Pedantic Note. Jacques Carette's paper: Understanding Expression
Simplification.
Proc. ISSAC 2004 (ed. J. Gutierrez), ACM Press, New York, 2004, pp. 72-79.
Sorry for catching up so late,
The Maple package for differential algebra, mostly written by François Boulier,
has been ported to SAGE. It is not part of SAGE yet, but we hope that it will
soon be.
In any case, you can follow its progress there :
might each be considered simpler depending on the context, which is the
way a lot of people who don't know about decidability would perceive this
question (or so my experience has been interacting with a lot of people who
ask about why Sage doesn't simplify this or that). I suppose the
Thank you very much for your help.
On 9 December 2012 12:18, Georgi Guninski gunin...@guninski.com wrote:
On Sat, Dec 08, 2012 at 11:44:19AM +0530, Santanu Sarkar wrote:
Dear all,
I have a system of non linear equations over GF(2). How to solve
them in Sage?
If you need to solve
I have a set of non-linear
equations over a prime field.
I want to solve them using
Groebner basis technique.
When I want to calculate
Groebner basis, I have following error.
verbose 0 (3292: multi_polynomial_ideal.py, groebner_basis) Warning:
falling back to very slow toy implementation.
Hi!
On 2012-12-13, Santanu Sarkar sarkar.santanu@gmail.com wrote:
When I want to calculate
Groebner basis, I have following error.
verbose 0 (3292: multi_polynomial_ideal.py, groebner_basis) Warning:
falling back to very slow toy implementation.
This is not an error but a warning.
On Sat, Dec 08, 2012 at 11:44:19AM +0530, Santanu Sarkar wrote:
Dear all,
I have a system of non linear equations over GF(2). How to solve
them in Sage?
How large is your system ? (how many variables ?). What is the largest degree
in an equation ? Depending on the answer to these
