[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread Mike Hansen
Patches attached to http://www.sagetrac.org/sage_trac/ticket/764 . sage -testall passes, but the test for hash(P) in multi_polynomial_libsingular.pyx needs to be changed for 32-bit machines since I don't have access to one. --Mike --~--~-~--~~~---~--~~ To post to

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread William Stein
On Sep 30, 2007, at 12:33 PM, "Mike Hansen" <[EMAIL PROTECTED]> wrote: > > On 9/30/07, Martin Albrecht <[EMAIL PROTECTED]> wrote: >> >> On Sunday 30 September 2007, John Cremona wrote: >>> I agree with this (but the documentation should be very clear). >>> It's >> >> +1 >> >> Martin > > sage:

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread Mike Hansen
On 9/30/07, Martin Albrecht <[EMAIL PROTECTED]> wrote: > > On Sunday 30 September 2007, John Cremona wrote: > > I agree with this (but the documentation should be very clear). It's > > +1 > > Martin sage: PolynomialRing(ZZ, 'x') Univariate Polynomial Ring in x over Integer Ring sage: PolynomialR

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread Martin Albrecht
On Sunday 30 September 2007, John Cremona wrote: > I agree with this (but the documentation should be very clear). It's +1 Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread John Cremona
I agree with this (but the documentation should be very clear). It's the same in Magma: > Type(PolynomialRing(RationalField())); RngUPol > Type(PolynomialRing(RationalField(),1)); RngMPol John On 30/09/2007, William Stein <[EMAIL PROTECTED]> wrote: > > On 9/30/07, Mike Hansen <[EMAIL PROTECTED

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread Mike Hansen
> Wait! This would an explicit intentional design choice, not a bug. > I think it should be possible to create ZZ['x'] but as a multivariate > polynomial ring instead of a univariate polynomial ring, > since there are certain things one can do with multivariate > polynomial rings that don't make

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread William Stein
On 9/30/07, Mike Hansen <[EMAIL PROTECTED]> wrote: > > > There is something *extremely* fishy about the base ring here! It's > > a *multivariate* polynomial ring: > > Here is the culprit: > > sage: type(PolynomialRing(ZZ, 1, 'x')) > 'sage.rings.polynomial.multi_polynomial_ring.MPolynomialRing_po

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-30 Thread Mike Hansen
> There is something *extremely* fishy about the base ring here! It's > a *multivariate* polynomial ring: Here is the culprit: sage: type(PolynomialRing(ZZ, 1, 'x')) while sage: type(PolynomialRing(ZZ, 'x')) I've created a ticket: http://www.sagetrac.org/sage_trac/ticket/764 and will post

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-29 Thread William Stein
On 9/29/07, Mike Hansen <[EMAIL PROTECTED]> wrote: > I've been recently doing some work which requires linear algebra over > fraction fields of polynomial rings. I found that this is _much_ > slower than it should be. > > sage: hlqp5 = [ symmetrica.hall_littlewood(p) for p in Partitions(5) ] > >

[sage-devel] Re: Slow linear algebra over (fraction fields) of polynomial rings

2007-09-29 Thread Robert Bradshaw
On Sep 29, 2007, at 10:50 PM, Mike Hansen wrote: > > Hello, > > I've been recently doing some work which requires linear algebra over > fraction fields of polynomial rings. I found that this is _much_ > slower than it should be. > > sage: hlqp5 = [ symmetrica.hall_littlewood(p) for p in Partitio