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 m
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())
Out[2]:
In [3]:ideal=[a111 *
Hi,
On Aug 3, 7:39 pm, Martin Albrecht
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 goes over 1.6GB and t
> 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 r
On Saturday 01 August 2009, Simon King wrote:
> Hi Martin,
>
> On Aug 1, 4:09 pm, Martin Albrecht
>
> wrote:
> > sage: R. =
> > BooleanPolynomialRing(order='lex')
> > sage: I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111
> > + : a112 * b212 * c112 - 0 , a121 * b111 * c111
On Aug 2, 2:59 am, john_perry_usm wrote:
> Raphael,
>
> > Also, I read back in April that there was a plan to implement
> > Faugere's F4 algorithm. As the systems I want to solve are very large,
> > I would be particularly interested in that or any related tools that
> > are in development. (An
Raphael,
> Also, I read back in April that there was a plan to implement
> Faugere's F4 algorithm. As the systems I want to solve are very large,
> I would be particularly interested in that or any related tools that
> are in development. (Anyone working on an XL variant?)
There is some work bei
Thanks very much for the reply.
> Finally, for solving you should use a lexicographical term ordering:
>
> sage: R. =
> BooleanPolynomialRing(order='lex')
> sage: I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111 +
> : a112 * b212 * c112 - 0 , a121 * b111 * c111 + a122 * b11
Hi Martin,
On Aug 1, 4:09 pm, Martin Albrecht
wrote:
> sage: R. =
> BooleanPolynomialRing(order='lex')
> sage: I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111 +
> : a112 * b212 * c112 - 0 , a121 * b111 * c111 + a122 * b112 * c112 ,
> : a121 * b211 * c111 + a122 * b212
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.=GF(2)[]
> I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111 +
> a112 * b212 * c112 - 0 , a121 * b111
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 wrote:
> I am new to sage and am attempting to solve systems of multivariate
> polys over GF(2). My
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 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.=GF(2)[]
> I=
12 matches
Mail list logo
