[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-04 Thread Michael Brickenstein
Hi! I think the problem is quite hard using Gröbner bases, I also talked to Gregory Bard about the topic in Sage days 10. Nevertheless it is interesting. Did you convert the polynomial system to cnf using Martins converter. Does it also solve the bigger problem, you gave me? Can you please give

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-03 Thread Martin Albrecht
On Saturday 01 August 2009, Simon King wrote: Hi Martin, On Aug 1, 4:09 pm, Martin Albrecht m...@informatik.uni-bremen.de wrote: sage: R.a111,a112,a121,a122,b111,b112,b211,b212,c111,c112 = BooleanPolynomialRing(order='lex') sage: I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 *

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-03 Thread Martin Albrecht
The problem in my case is really one of scale. I have put a larger example at the bottom of this message. When I try to find the groebner basis in sage 4.1 (which seems to use polybori-0.5rc.p8) the memory usage goes over 1.6GB and then sage crashes. It is possible that it just isn't

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-03 Thread lesshaste
Hi, On Aug 3, 7:39 pm, Martin Albrecht m...@informatik.uni-bremen.de wrote: The problem in my case is really one of scale. I have put a larger example at the bottom of this message.  When I try to find the groebner basis in sage 4.1 (which seems to use polybori-0.5rc.p8) the memory usage

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-03 Thread Michael Brickenstein
Hi! I can't sleep, when fearing PolyBoRi could calculate wrong: Actually, it's probably just about the wrapper. My CVS, which is very much the same as 0.6.3 gives me: l=a111,a112,a121,a122,b111,b112,b211,b212,c111,c112.split(,) In [2]:declare_ring(l, globals())

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-01 Thread Martin Albrecht
On Monday 27 July 2009, lesshaste wrote: I am new to sage and am attempting to solve systems of multivariate polys over GF(2). My first attempt with a small example is R.a111,a112,a121,a122,b111,b112,b211,b212,c111,c112=GF(2)[] I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 *

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-08-01 Thread lesshaste
Thanks very much for the reply. Finally, for solving you should use a lexicographical term ordering: sage: R.a111,a112,a121,a122,b111,b112,b211,b212,c111,c112 = BooleanPolynomialRing(order='lex') sage: I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111 + : a112 * b212

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-07-31 Thread Harald Schilly
bump, since there was no answer so far and despite i don't know the answer it should be rather simple ... ? On Jul 27, 7:01 pm, lesshaste drr...@gmail.com wrote: I am new to sage and am attempting to solve systems of multivariate polys over GF(2).  My first attempt with a small example is

[sage-support] Re: Solving multivariate polynomial systems over GF(2)

2009-07-31 Thread Simon King
Harald, thank you for reminding us of this post. Raphael, Actually I started an answer a while ago, but thought it wouldn't be helpful and therefore didn't post it. On 27 Jul., 19:01, lesshaste drr...@gmail.com wrote: I am new to sage and am attempting to solve systems of multivariate polys