[sage-devel] 3 feature request for multivariate polynomials

2007-07-27 Thread didier deshommes
Hi there, I'm trying to work with multivariate polynomials in SAGE and here are 3 features that I would like. Assume f is a multi-poly: * f.coefficients() for multivariate polynomials. I would like to get all the coefficients of f in a list, according to the term order attached to its ring (this

[sage-devel] 1.1.3-r2764 vs. gcc 4.2.x

2007-07-27 Thread mabshoff
Hello folks, current svn does not build all tests when using gcc 4.2.x. This has come up before and now again (see http://groups.google.com/group/sage-devel/browse_thread/thread/72f84af600a753a1 - Hello Kate ;). While SAGE 2.7.1 ships an older LinBox svn snapshot (tagged 2007-07-17) the problem s

[sage-devel] Re: computing the number of partitions of an integer

2007-07-27 Thread William Stein
On 7/27/07, Pablo De Napoli <[EMAIL PROTECTED]> wrote: > > Your version did work for me! > Pablo Great. Is there any chance you could work on any of the optimization or timing ideas Bill Hart suggested in the previous post? I won't be able to work on this myself for a while. -- William --~--

[sage-devel] Re: computing the number of partitions of an integer

2007-07-27 Thread Pablo De Napoli
Your version did work for me! Pablo On 7/27/07, William Stein <[EMAIL PROTECTED]> wrote: > On 7/27/07, Pablo De Napoli <[EMAIL PROTECTED]> wrote: > > > > I've tested it but seems to be buggy:: it works up to 156 > > > > ./part 156 > > p(156)= > > 73232243759 > > > > but for 157 gives a floating

[sage-devel] Fwd: [sage-devel] Re: computing the number of partitions of an integer

2007-07-27 Thread William Stein
-- Forwarded message -- From: William Hart <[EMAIL PROTECTED]> Date: Jul 27, 2007 11:58 AM Subject: Re: [sage-devel] Re: computing the number of partitions of an integer To: William Stein <[EMAIL PROTECTED]> Some things to try (in order of importance): * how long does it take to

[sage-devel] 2.7.1 and gcc-2.4.1 linbox problem

2007-07-27 Thread Kate Minola
SAGE-2.7.1 sadly does NOT build if you use the latest stable release of the gcc compiler (gcc-4.2.1). It fails in linbox for probably the same reason as was given in the thread: 2.5.3 and gcc-2.4.0 linbox problem SAGE-2.7.1 does build and pass its test suite on my x86-Linux (pentium4) if built

[sage-devel] Re: computing the number of partitions of an integer

2007-07-27 Thread William Stein
On 7/27/07, Pablo De Napoli <[EMAIL PROTECTED]> wrote: > > I've tested it but seems to be buggy:: it works up to 156 > > ./part 156 > p(156)= > 73232243759 > > but for 157 gives a floating point exception error > (and a gdb tracing says it is in the line 176 of > the source code > > r2 = r0 % r1;

[sage-devel] Re: interaction between GAP and notebook

2007-07-27 Thread Dan Christensen
4) If I use GAP Print(...) commands in a short notebook entry, I see the output. But if the entry is longer, I don't see the output. I would add this to the trac ticket, but I don't think I have an account. Dan --~--~-~--~~~---~--~~ To post to this group, sen

[sage-devel] Re: computing the number of partitions of an integer (fixes in latest pari)

2007-07-27 Thread Pablo De Napoli
This problem seems to be fixed in pari-2.4.2 (not yet realead!, code in CVS) ?numbpart((5*10535+4)) time = 16 ms. %2 = 132775694853416614410709359082850304628573507097148711672236023178345995078715426574030466347126367130008280402558755564770977624160764152691390102001213796297899514590335375857

[sage-devel] Re: computing the number of partitions of an integer

2007-07-27 Thread Pablo De Napoli
I've tested it but seems to be buggy:: it works up to 156 ./part 156 p(156)= 73232243759 but for 157 gives a floating point exception error (and a gdb tracing says it is in the line 176 of the source code r2 = r0 % r1; in function g I've compiled it using gcc part.c -g -lmpfr -lm -DTEST_CO