From: "Jonathan Bober" <[EMAIL PROTECTED]>
> It's not quite ready for inclusion, but, eventually, maybe Bill Hart's
> prediction about it only taking 10 seconds to compute p(10^9) on
> sage.math will come true.
That's fantastic! Great work!
Alec
--~--~-~--~~~---~--~
Since you've extended this thread some more, I'll mention that the
current version of the code that I am working on runs a little bit more
than twice as fast as that version. It's posted at
http://www.math.lsa.umich.edu/~bober/partitions_c.cc
if anyone is interested in testing it. (But don't was
4 Color theorem -
I may be wrong, but as far as I know, the proof by Robertson, Seymour,
Sanders and Thomas also requires computational verification of parts
of the proof.
http://www.math.gatech.edu/~thomas/FC/fourcolor.html
But I am not sure if there is a further simplification that no more
needs
On Aug 3, 2007, at 21:01 , William Stein wrote:
> David Joyner and I are writing an "opinion column" for the Notices
> of the
> AMS on "funding open source mathematical software". It must be at
> most 800 words, and we have a first rough draft. We have to finish it
> fairly quickly. I've at
> David Joyner and I are writing an "opinion column" for the Notices of the
> AMS on "funding open source mathematical software". It must be at
> most 800 words, and we have a first rough draft. We have to finish it
> fairly quickly. I've attached the current version to this email.
> Feedback
From: "William Stein" <[EMAIL PROTECTED]>
> Thanks. I've fixed this for sage >= 2.7.3 in the attached patch.
Just upgraded SAGE to 2.7.3 and number_of_partitions works twice as fast as
in 2.7.2 with algorithm='bober' for 10^9 - it took 112 sec in 2.7.2 and only
56 sec in 2.7.3. This is in Ubu
On 8/3/07, Alex Ghitza <[EMAIL PROTECTED]> wrote:
> I've run into a couple of problems while installing sage-2.7.3:
>
> 1. first I tried to install it from scratch; it choked on
> lapack-20070723, and here's the end of install.log:
>
...
> 2. si
Hi,
I've run into a couple of problems while installing sage-2.7.3:
1. first I tried to install it from scratch; it choked on
lapack-20070723, and here's the end of install.log:
Host system
uname -a:
Linux latitude 2.6.21-gentoo-r4 #1 SMP Wed
Hi SAGE developers,
My main goals for SAGE-2.8 are:
(1) Get the new singular to work
(2) Include new version of linbox and givaro (mainly so
SAGE will build under gcc 4.2).
(3) Include some excellent new quadratic forms code of
David Kohel, Gabe Nebe, and Jon Voight from
On 8/3/07, Joshua Kantor <[EMAIL PROTECTED]> wrote:
> The eigen routine uses numpy. If you do
> p,e=m.eigen()
>
> then p is an array of eigenvalues and e is a matrix whose columns are
> eigenvectors.
> The documentation works fine in my local install not sure why it fails
> on sage.math
This is p
The eigen routine uses numpy. If you do
p,e=m.eigen()
then p is an array of eigenvalues and e is a matrix whose columns are
eigenvectors.
The documentation works fine in my local install not sure why it fails
on sage.math
Josh
On Aug 3, 2:43 pm, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
>
>> But,it needs vmware. Inside Microsoft that is not easy, can we use
>> Microsoft's virtualpc or any other idea?
>
> Yes, I could definitely make a Microsoft virtualpc version of SAGE!
> I'll look into it when I get back -- or perhaps somebody on sage-devel
> who uses virtualpc and has run some
Linear algebra over RR is generic and, in many cases, really bad so
far. Use RDF or even scipy unless you really need arbitrary
precision. (If the RDF interface is inconsistent, fix it and send a
patch :-)
- Robert
On Aug 1, 2007, at 6:28 AM, Robert Miller wrote:
>
> Hi everyone,
>
> I ha
As announced on linbox-devel, the gcc-4.2 problem with LinBox has been
fixed, and the up to date code can be retrieved from the svn server of
LinBox. We are soon going to release version 1.1.4.
Since LinBox and SAGE use intensively Givaro, we also fixed givaro
code, that had the same problem. We
You are right, this will succeeded in the new pushout model
Z
/ \
Q Zp
\ /
Qp
On Aug 3, 2007, at 9:37 AM, David Harvey wrote:
>
> The following currently fails, but I think it should succeed:
>
> sage: 5^-1 * 21 + O(5^3)
> --
On 8/3/07, someone at Microsoft wrote:
> Hi William
>
> I am back from my trips. I have recommended use of SAGE to many , in
> particular interns.
>
> But,it needs vmware. Inside Microsoft that is not easy, can we use
> Microsoft's virtualpc or any other idea?
Yes, I could definitely make a Micr
The following currently fails, but I think it should succeed:
sage: 5^-1 * 21 + O(5^3)
---
Traceback (most recent call
last)
/home/dmharvey/regulators/ in ()
/home/dmharvey/regulators/element.pyx in element
17 matches
Mail list logo
