Fwd: Re: [sage-devel] imag(CC(infinity)) is 0?

2013-10-04 Thread William Stein
-- Forwarded message -- From: "Zimmermann Paul" Date: Oct 4, 2013 10:53 PM Subject: Re: [sage-devel] imag(CC(infinity)) is 0? To: "William Stein" Cc: William, [please forward to sage-devel since I'm not sure I'm allowed to post there] > The implementation of RR and CC i

Re: [sage-devel] imag(CC(infinity)) is 0?

2013-10-04 Thread Zimmermann Paul
William, [please forward to sage-devel since I'm not sure I'm allowed to post there] > The implementation of RR and CC in Sage are a very direct wrapping of > MPFR, which is the most well-thought out efficient implementation of > floating point real numbers I've ever seen. It is worth vis

[sage-devel] Re: motivation: here's one reason your contributions to Sage matter...

2013-10-04 Thread rjf
On Thursday, October 3, 2013 10:17:42 AM UTC-7, Keshav Kini wrote: > > rjf > writes: > > On Monday, September 30, 2013 11:42:43 PM UTC-7, Keshav Kini wrote: > > But as far as I know, Sage is not proof-aware in any way. > > > > Why would you necessarily know about this? > > I don't kn

Re: [sage-devel] imag(CC(infinity)) is 0?

2013-10-04 Thread William Stein
On Fri, Oct 4, 2013 at 1:56 PM, Greg Laun wrote: > Thanks Peter. I agree that infinity in RR is a big problem. For those > following the discussion, Peter updated Trac ticket #11506 to reflect this > concern and it is now marked as a critical bug. I've added a long comment there (http://trac.sa

Re: [sage-devel] imag(CC(infinity)) is 0?

2013-10-04 Thread Greg Laun
Thanks Peter. I agree that infinity in RR is a big problem. For those following the discussion, Peter updated Trac ticket #11506 to reflect this concern and it is now marked as a critical bug. On Thursday, October 3, 2013 5:31:06 PM UTC-4, Peter Bruin wrote: > > Hello, > > from the perspecti

Re: [sage-devel] Re: Build Error in gf2x package on AMD Athlon XP 2600+

2013-10-04 Thread Emmanuel Thomé
my latest mail, after I checked in the changes which I believe is right, did not include a tar.gz file indeed. Will create one later. E. On Fri, Oct 4, 2013 at 7:50 PM, Andrew Fiori wrote: > I never did figure out how to grab the latest snapshot off the gf2x dev > site, I had been working with t

Re: [sage-devel] Re: Build Error in gf2x package on AMD Athlon XP 2600+

2013-10-04 Thread Andrew Fiori
I never did figure out how to grab the latest snapshot off the gf2x dev site, I had been working with the tarballs linked in this thread, of which I never tested one that worked (though, I believe we determined which changes would fix the problem). Right now that machine is being tortured by runnin

Re: [sage-devel] Re: Build Error in gf2x package on AMD Athlon XP 2600+

2013-10-04 Thread Jean-Pierre Flori
It seems I only sent my reply to Emmanuel. So briefly: - Andrew: can you please confirm that the latest tarball provided by Emmanuel is fixed? - if that's the case, I'll open a trac ticket to update the gf2x spkg provided by Sage and it should make its way into Sage 5.12 or 5.13. Best, JP On Fr

Re: [sage-devel] Re: Build Error in gf2x package on AMD Athlon XP 2600+

2013-10-04 Thread Emmanuel Thomé
could you pleae confirm that the fix I've committed to the gf2x main branch fixes the issue you encounter ? This is a genuine bug which deserves to be fixed, so: - I care about whether my changes correct the issue. - I don't mind creating a bugfix tarball if deemed useful. On the other hand, if

[sage-devel] Re: Build Error in gf2x package on AMD Athlon XP 2600+

2013-10-04 Thread Robert Campbell
The bug appears to be something in gf2x's configure.ac file, but as I know little about writing config scripts it's hard to give advice. In the meantime, here is a simple step-by-step for those who want SAGE-5.11 but have an old pre-SSE2 machine (schools & cheapskates like me): 1) Confirm that

Re: [sage-devel] Re: Factorization of multivariate integer polynomial

2013-10-04 Thread Marco Streng
2013/10/4 Jori Mantysalo > On Fri, 4 Oct 2013, Volker Braun wrote: > > If the integral polynomial is not monic then the roots need not be >> integral: >> >> sage: R. = QQ[] >> sage: (4*x^2-1).factor() >> (4) * (x - 1/2) * (x + 1/2) >> > (4*x^2-1) = (2*x-1)*(2*x+1) ZZ[x] has unique factorization

Re: [sage-devel] Re: Factorization of multivariate integer polynomial

2013-10-04 Thread Jori Mantysalo
On Fri, 4 Oct 2013, Volker Braun wrote: If the integral polynomial is not monic then the roots need not be integral: sage: R. = QQ[] sage: (4*x^2-1).factor() (4) * (x - 1/2) * (x + 1/2) So this would not be factorizable in ZZ[x] but is factorizable in QQ[x] Of course. Duh. Anyways, is this

[sage-devel] Re: Factorization of multivariate integer polynomial

2013-10-04 Thread Volker Braun
If the integral polynomial is not monic then the roots need not be integral: sage: R. = QQ[] sage: (4*x^2-1).factor() (4) * (x - 1/2) * (x + 1/2) So this would not be factorizable in ZZ[x] but is factorizable in QQ[x] On Friday, October 4, 2013 12:44:41 PM UTC+1, Jori Mantysalo wrote: > > $SAG

[sage-devel] Factorization of multivariate integer polynomial

2013-10-04 Thread Jori Mantysalo
$SAGE_ROOT/devel/sage-main/sage/rings/polynomial/multi_polynomial_libsingular.pyx contains if not self._parent._base.is_field(): raise NotImplementedError, "Factorization of multivariate polynomials over non-fields is not implemented." It seems trivial to have at least working (but maybe sl