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,
I have been trying to install sage4.1 on ubuntu 8.04 by following the
steps
described in the readme file, i.e. I downloaded the source code ,
unzipped it to the subdirectory sage/sage-4.1 in my home directory,
and started "make" from there. This has ended up in
the following error (trailing
I'm on holiday but will look into this when I can.
John Cremona
(author of mwrank, but not of the Sage/msrank interface ;))
On Jul 31, 6:48 pm, cronopio wrote:
> I am using Sage Version 4.1, Release Date: 2009-07-09 on an iMac Intel
> core 2 duo running Mac OS X 10.5.7 to compute the rank of a
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
Hi,
Attached is the code.
x = var('x')
def f(x):
if (x > 0):
return x**2
elif (x <= 0):
return -x**2
f(x).integrate(x, 0, 10)
output:
Traceback (most recent call last):
File "", line 1, in
File "/home/mc/.sage/sage_notebook/worksheets/admin/2/code/58.py", line 14,
