Even, if that bug wouldn't exist, I can only recommend
to do such computation over the rationals, if possible.
Gröbner bases and similar computations (like syzygies) over floating
point numbers are
very problematic: What is the leading term of a polynomial, where you
can't exactly determine, whic
On Sat, Nov 1, 2008 at 2:35 AM, alunw <[EMAIL PROTECTED]> wrote:
>
> Thanks for this.
>
> I'll certainly consider doing this, though I'm still slightly
> concerned about the implications for my own code. I guess using the
> GPL is probably as good a way as any of deterring potential commercial
> c
On Oct 31, 7:58 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Fri, Oct 31, 2008 at 7:53 PM, mabshoff <[EMAIL PROTECTED]> wrote:
>
> > On Oct 31, 7:49 pm, mhampton <[EMAIL PROTECTED]> wrote:
> >> I never used the former version much at all, but trying this out it
> >> seems pretty snappy at
On Fri, Oct 31, 2008 at 7:53 PM, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> On Oct 31, 7:49 pm, mhampton <[EMAIL PROTECTED]> wrote:
>> I never used the former version much at all, but trying this out it
>> seems pretty snappy at the moment - almost as fast as my macbook (2.4
>> GHz core 2 duo).
>
On Sat, Nov 1, 2008 at 11:44 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> I've created a brand new sagenb.org VMware virtual machine. It's
> state is the same as the sagenb.org
> virtual when it is was fork bombed.
>
> The main difference is that now:
[...]
> 3. It uses http instead
On Oct 31, 7:49 pm, mhampton <[EMAIL PROTECTED]> wrote:
> I never used the former version much at all, but trying this out it
> seems pretty snappy at the moment - almost as fast as my macbook (2.4
> GHz core 2 duo).
>
> I did get an error trying to use phc, maybe that's not news but if so
> her
I never used the former version much at all, but trying this out it
seems pretty snappy at the moment - almost as fast as my macbook (2.4
GHz core 2 duo).
I did get an error trying to use phc, maybe that's not news but if so
here it is:
sh: phc: Permission denied
Traceback (most recent call last
On Oct 31, 7:23 pm, mhampton <[EMAIL PROTECTED]> wrote:
> I don't mean to nit-pick but I didn't contribute to #2364 except to
> review.
Fixed. Some times with messy tickets like that one things get screwed
up. And I rather give too much credit than too little. But it is
always a good thing to p
I don't mean to nit-pick but I didn't contribute to #2364 except to
review.
-Marshall
On Oct 31, 7:13 pm, mabshoff <[EMAIL PROTECTED]> wrote:
> Hello folks,
>
> here goes 3.2.alpha2 which should fix all known issues from
> 3.2.alpha1. A lot of fixes from BD 15 were merged and we are well on
> th
Hi,
I've created a brand new sagenb.org VMware virtual machine. It's
state is the same as the sagenb.org
virtual when it is was fork bombed.
The main difference is that now:
1. It is running in a VMware virtual machine on my desktop. The
virtual machine
has 2GB RAM, 10GB swap, and 4
Hello folks,
according to wstein's Axiom I every piece of code not tested is
broken. In that spirit I had planned for months to run all optional
doctests and I finally took the time to do so. First I installed
* frobby-0.7.6
* fricas-1.0.3p0
* boehm_gc-7.1.p0, gdbm-1.8.3, macaulay2-1.1-r7221
Hello folks,
here goes 3.2.alpha2 which should fix all known issues from
3.2.alpha1. A lot of fixes from BD 15 were merged and we are well on
the way to the final 3.2. I plan to do another alpha3 in two days
unless I run our of time in which case we will have the first
3.2.rc0.
Sources and a bin
I believe William explained it nicely, but just to make it clear: YOU
wrote the program, so you have the rights to relicense it anyway you
want even after you release it as GPL.
The point of GPL is to release the software to the public so that it can
be used in a non-closed manner, but even when
On Oct 31, 10:31 am, Jason Grout <[EMAIL PROTECTED]> wrote:
> mabshoff wrote:
>
> > On Oct 31, 2:05 am, Ralf Hemmecke <[EMAIL PROTECTED]> wrote:
> >>> Sage is full of "fields" that aren't actually fields mathematically.
> >>> Field in Sage means "object that models a mathematical field",
> >>> b
mabshoff wrote:
>
>
> On Oct 31, 2:05 am, Ralf Hemmecke <[EMAIL PROTECTED]> wrote:
>>> Sage is full of "fields" that aren't actually fields mathematically.
>>> Field in Sage means "object that models a mathematical field",
>>> but includes e.g., the "field of double precision floating point numb
2008/10/31 alunw <[EMAIL PROTECTED]>:
>
> As a matter of fact I had an email from Martin Edjvet earlier today
> who told me that he had a student
> called Jerry Swan "who also came up with his modified (improved?)
> version (called KBMAGNUM) which was set up
> to deal with batches of presentations
On Fri, Oct 31, 2008 at 8:55 AM, Timothy Clemans
<[EMAIL PROTECTED]> wrote:
>
> This is the very reason that Sage is GPLed. Mathematica and MAGMA both
> use GMP and then go around saying how much faster their code is then
> standard GMP.
The Mathematica devs don't do that. Allan Steel did somet
This is the very reason that Sage is GPLed. Mathematica and MAGMA both
use GMP and then go around saying how much faster their code is then
standard GMP.
I think I heard something about MySQL doing so well because there is a
dual license where if a company needs MySQL under a special license
they
Sorry about that "sorry to here..."
By commercial I meant software that has to be paid for to be used
legitimately. So I guess Red Hat is commercial by that
yardstick. But last time I looked that was an OS, so I'd be happy to
donate to that. Mathematica is another matter. I'd be both flattered
an
On Fri, Oct 31, 2008 at 8:35 AM, alunw <[EMAIL PROTECTED]> wrote:
>
> Thanks for this.
>
> I'll certainly consider doing this, though I'm still slightly
> concerned about the implications for my own code. I guess using the
> GPL is probably as good a way as any of deterring potential commercial
>
Thanks for this.
I'll certainly consider doing this, though I'm still slightly
concerned about the implications for my own code. I guess using the
GPL is probably as good a way as any of deterring potential commercial
competitors from "stealing" my code - though I'm not really expecting
or even w
On Fri, Oct 31, 2008 at 8:17 AM, alunw <[EMAIL PROTECTED]> wrote:
>
> As a matter of fact I had an email from Martin Edjvet earlier today
> who told me that he had a student
> called Jerry Swan "who also came up with his modified (improved?)
> version (called KBMAGNUM) which was set up
> to deal w
As a matter of fact I had an email from Martin Edjvet earlier today
who told me that he had a student
called Jerry Swan "who also came up with his modified (improved?)
version (called KBMAGNUM) which was set up
to deal with batches of presentations".
He tells me is using it now with a file of abou
On Fri, Oct 31, 2008 at 7:49 AM, alunw <[EMAIL PROTECTED]> wrote:
>
> I'm sorry to here you think I am imposing restrictions.
> In fact all I am trying to do is prevent restrictions being imposed
> upon me and other potential users, and protect myself from being
> exploited.
You are imposing one
I'm sorry to here you think I am imposing restrictions.
In fact all I am trying to do is prevent restrictions being imposed
upon me and other potential users, and protect myself from being
exploited.
Although MAF is a substantial package in its own right it contains a
lot of code which is common
On Fri, Oct 31, 2008 at 5:40 AM, alunw <[EMAIL PROTECTED]> wrote:
>
> For the past few years I have been developing a package called MAF
> which is a reimplementation in C++ of KBMAG. It extends KBMAG in
> several ways, and is usually, though not always, a lot faster than it.
> For example it can
On Monday 27 October 2008, mmarco wrote:
> R.=PolynomialRing(CC)
> config2=(x^2+8*y^2+21*x*y-x*z-8*y*z)*(x^2+5*y^2+13*x*y-
> x*z-5*y*z)*(x^2+9*y^2-4*x*y-x*z-9*y*z)*(x^2+11*y^2+x*y-
> x*z-11*y*z)*(x^2+17*y^2-5*x*y-x*z-17*y*z)
> miid=R.ideal(diff(config2,x),diff(config2,y),diff(config2,z),config2)
I'm interested by this in a couple of ways. First, the author of
KBMAG is my Warwick colleague Derek Holt, and I had been wondering
whether he might want to contribute KBMAG to Sage. Note that KBMAG is
already available as a Gap package (see
http://www.warwick.ac.uk/~mareg/kbmag/) so I presume t
On Friday 31 October 2008, David Joyner wrote:
> Unfortunately, your licensing restrictions seem to be incompatible with
> Sage.
>
> All Sage code must be GPL compatible.
> See
> http://www.sagemath.org/doc/tut/node6.html
> and
> http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
> for informat
Unfortunately, your licensing restrictions seem to be incompatible with
Sage.
All Sage code must be GPL compatible.
See
http://www.sagemath.org/doc/tut/node6.html
and
http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
for information on the Sage goals and GPL2 license.
However, you are free t
For the past few years I have been developing a package called MAF
which is a reimplementation in C++ of KBMAG. It extends KBMAG in
several ways, and is usually, though not always, a lot faster than it.
For example it can calculate the automatic structure of F(2,9) in
10-15 minutes (depending on C
On Oct 31, 2:05 am, Ralf Hemmecke <[EMAIL PROTECTED]> wrote:
> > Sage is full of "fields" that aren't actually fields mathematically.
> > Field in Sage means "object that models a mathematical field",
> > but includes e.g., the "field of double precision floating point numbers",
> > which isn't
> Sage is full of "fields" that aren't actually fields mathematically.
> Field in Sage means "object that models a mathematical field",
> but includes e.g., the "field of double precision floating point numbers",
> which isn't really a field (e.g., it is finite).
And + is not associative...
I gu
On Oct 30, 6:06 pm, Ralf Hemmecke <[EMAIL PROTECTED]> wrote:
> > Formal Laurent series would also form a field.
> > For example the formal Laurent series are a field.
>
> While this is certainly true mathematically, you might run into trouble
> computationally.
>
> In a (additive and commutative)
34 matches
Mail list logo
