[sage-devel] Re: Memory leak coming from MixedIntegerLinearProgram ???

This also appears to leak memory: def get_polytope(): q = MixedIntegerLinearProgram( maximization = False, solver = 'Coin' ) w = q.new_variable(real = True, nonnegative = True) q.add_constraint( w[0] == 0 ) def fill_memory(n): for i in xrange(n): P =

Re: [sage-devel] Multivariate polynomial factoring and bug(?)

Are there open-source implementations of this available? the only (somewhat) fast library I know is Singular's factory (https://github.com/Singular/Sources/blob/spielwiese/factory/README) used both in Singular and in Macaulay2... Also, if you need to output factors, which might exist only over

Re: [sage-devel] plot3d Assertion Error in Jupyter Notebook

Thank you very much William. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to

Re: [sage-devel] Multivariate polynomial factoring and bug(?)

I think that there are carefully constructed polynomials of modest degree that will be surprisingly expensive to factor. For example, a polynomial that factors in all the finite fields that are attempted, but are irreducible over Z[x]. Randomly generated polynomials, as Nils says, are almost

Re: [sage-devel] Building Sage 7.4 final release on OS X El Capitan

The one package that stuck in my mind was Cython, and for some reason the error log for that one is not yet overwritten. Here's that error message: OSError: [Errno 2] No such file or directory: '/Users/Masson/Downloads/GitHub/sage/local/lib/python2.7/site-packages/backports_abc-0.4-py2.7.egg'

Re: [sage-devel] Multivariate polynomial factoring and bug(?)

On Thursday, November 3, 2016 at 1:37:25 PM UTC-4, Dima Pasechnik wrote: > > > > On Thursday, November 3, 2016 at 1:06:05 PM UTC, Bill Hart wrote: >> >> >> >> On Friday, 28 October 2016 18:44:09 UTC+2, Dima Pasechnik wrote: >>> >>> 5 variables and degree 100 is really, really huge. Especially over

[sage-devel] change_ring() in PolynomialSequence and Ideal of Multivariate Polynomial

Hi, Previously, I have created a ticket #21780 to implement the function change_ring() in PolynomialSequence class with the intention to provide a simple interface in changing the ring property. The function takes 3 optional arguments : base_ring, names,

[sage-devel] Re: Issue with figures in doc.sagemath.org

Le jeudi 3 novembre 2016 17:50:44 UTC+1, Harald Schilly a écrit : > > > That's taken care of > Thanks! -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to

Re: [sage-devel] Multivariate polynomial factoring and bug(?)

On Thursday, November 3, 2016 at 1:06:05 PM UTC, Bill Hart wrote: > > > > On Friday, 28 October 2016 18:44:09 UTC+2, Dima Pasechnik wrote: >> >> 5 variables and degree 100 is really, really huge. Especially over QQ, >> the coefficients of >> polynomials will just totally blow. >> In fact, 5

[sage-devel] Re: Issue with figures in doc.sagemath.org

On Wednesday, November 2, 2016 at 11:39:55 AM UTC+1, Eric Gourgoulhon wrote: > > Hi, > > Some 3D figures of the inline reference manual are not displayed on > http://doc.sagemath.org/html/en/reference/ > They are replaced by something like > That's taken care of, just an oversight by me …

[sage-devel] Re: Issue with figures in doc.sagemath.org

Wed 2016-11-02 13:43:27 UTC+1, Harald Schilly: > > Thanks for reporting that, I'll check what's going on. > It's probably some issue with symlinks ... > Thanks Harald for looking into it, it would be nice to have the pictures showing up in the documentation. NB. These pictures were added in

[sage-devel] Re: Error installing package ecl-15.3.7p0

Okay I have what looks like the same problem on a similar system, and there libffi-devel-gcc5 is installed. I opened https://trac.sagemath.org/ticket/21811 On Monday, May 9, 2016 at 3:08:58 PM UTC+2, Johannes Martin wrote: > > Hi, > > I cannot compile the source files of sage on > openSuse Leap

Re: [sage-devel] Re: Bug in caching mechanism of FiniteEnumeratedSet

#19562 is probably the best fix, but really that makes FiniteEnumeratedSet not really any different than our (finite) Sequence class. I'm thinking we need some sort of unification long-term. > Also, instead of Subsets(L), I would also use subsets(L) (or powerset(L)) > > as you don't need the

Re: [sage-devel] Multivariate polynomial factoring and bug(?)

On Friday, 28 October 2016 18:44:09 UTC+2, Dima Pasechnik wrote: > > 5 variables and degree 100 is really, really huge. Especially over QQ, the > coefficients of > polynomials will just totally blow. > In fact, 5 variables and degree 10 might still be quite hard, in > particular over QQ or

[sage-devel] Re: Multivariate polynomial factoring and bug(?)

What are P and Q here? The polynomials to be factored? Magma takes no appreciable time at all to factor these. It also finds the factors of their product in less than 3s with 32mb memory usage. Bill. On Sunday, 30 October 2016 19:21:24 UTC+1, parisse wrote: > > Unless I'm mistaken, the

[sage-devel] Re: Symbolic expressions assumptions and simplify in parallel

On Tuesday, November 1, 2016 at 1:55:00 PM UTC-4, Fedor Sumkin wrote: > > Hi all, > > Faced with a quite sad sage bug which arises with interval based > assumptions and full_simplify()/simplify() in called in parallel. > > Here is a gist : >

[sage-devel] Re: sage 7.4 does not build on Ubuntu 16.10

I opened a ticket last week, #21782 The same problem appears in debian testing. Currently I am building sage with gcc-5 On Thursday, October 20, 2016 at 2:23:19 PM UTC+2, Herbert Eisenbeis wrote: > > Link problem in flint-2-5.2: > /usr/bin/ld: -r and -pie may not be used together > > Log

Re: [sage-devel] Re: Bug in caching mechanism of FiniteEnumeratedSet

> Travis wrote: > Also, instead of Subsets(L), I would also use subsets(L) (or powerset(L)) > as you don't need the set of all subsets to be a parent. I see now that those functions don't support an argument for which size subsets you need (which is critical in my application). Best, Johan --

Re: [sage-devel] Re: Bug in caching mechanism of FiniteEnumeratedSet

Hi everyone, OK, we can bicker about the semantic difference of the words "bug" vs "intentional but bad design" all day, but in the end we agree it's not great for the user. It seems the ever-vigilant Vincent discovered the problem already a year ago and proposed a sensible fix for the problem in

[sage-devel] Re: Memory leak coming from MixedIntegerLinearProgram ???

Therefore, this should also leak: def get_polytope(): q = MixedIntegerLinearProgram( maximization = False, solver = 'Coin' ) w = q.new_variable(real = True, nonnegative = True) q.add_constraint( w[0] == 0 ) q.add_constraint( w[1] == 0 ) def fill_memory(n): for i in xrange(n):

Re: [sage-devel] Re: Bug in caching mechanism of FiniteEnumeratedSet

https://trac.sagemath.org/ticket/19562 -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email