I'm surprised that this hasn't been reported previously, because we can get
a crash even without atan or any division:
sin( x*(x+1) - x^2 - x ) # this crashes sage
This also crashes with sinh or cos or tan in the place of sin, but not with
exp or log.
PS I verified on CoCalc that this is no
Dear Enrique,
I am having a bit of trouble understanding exactly what computations are
slow and fast from your description. As Nils said, can you give us some
explicit code (with some comments about which parts are slow)?
Best,
Travis
On Tuesday, May 30, 2023 at 3:28:39 AM UTC+9 Nils Bruin w
Localized a bit further:
var("q A")
p = A*(1+1/A)-A-1
V=(q^p)._maxima_().rectform()
after this, V._sage_() crashes, and I think it's the same crash as above.
Transcribing what V is in maxima, we get:
I*sin(atan2(0,q)*((1/A+1)*A-A-1))*abs(q)^((1/A+1)*A-A-1)+cos(atan2(0,q)*((1/A+1)*A-A-1))*abs(q)
I was shown the following way of getting a segmentation fault in Sage.
sage: var("q A")
sage: p = A*(1+1/A)-A-1
sage: (q^p).full_simplify()
This consistently causes a crash. The person who found it was doing some
actual work, got a crash, and boiled it down to a minimal example.
Daniel Bump
--
Dear Enrique,
>From what you write I get the impression you may be talking about a
regression in performance relative to earlier versions of sage. If you want
to make an actionable item out of this, you'll probably have to file a
ticket with explicit code on it that can be profiled; preferably
Some time ago I had some computations on ideals in Laurent polynomial
rings, namely looking for minimal associated primes. Basically, I converted
any generator into a polynomial, study the ideal in the polynomial ring,
and forget the prime ideals containing monomials. From some time ago, it is
