Re: [sage-devel] Re: Adding functionality that depends on upgrading a standard package.

Please see https://github.com/miguelmarco/libbraiding/pull/4 On Mon, Nov 4, 2024 at 10:06 PM mmarco wrote: > > I have no experience on that whatsoever, so if you could do ir (or guide me > with it), i would really appreciate it. > > El lunes, 4 de noviembre de 2024 a las 17:52:07 UTC+1, dim...@g

[sage-devel] Re: division in polynomial rings

Hi Martin, On Tuesday, November 5, 2024 at 4:50:28 PM UTC+2 axio...@yahoo.de wrote: Does somebody have an old version of sage, so we can see whether this is a regression? Versions 9.5 - 10.4 produce the output you posted. Versions 9.0 - 9.4 take about 6 minutes and produce "1". Versions 7.0 -

[sage-devel] Re: division in polynomial rings

Hi, Le mardi 5 novembre 2024 à 15:50:28 UTC+1, axio...@yahoo.de a écrit : Does somebody have an old version of sage, so we can see whether this is a regression? Same result in Sage 9.8.rc1 (Release Date: 2023-02-05). Eric. -- You received this message because you are subscribed to the Goog

[sage-devel] Re: division in polynomial rings

This is now github issue #38928 , so future discussion should happen there. On Tuesday, November 5, 2024 at 11:58:59 AM UTC-5 Eric Gourgoulhon wrote: > Hi, > > Le mardi 5 novembre 2024 à 15:50:28 UTC+1, axio...@yahoo.de a écrit : > > Does somebody

Re: [sage-devel] division in polynomial rings

I can reproduce in Sage 10.4, and I found some additional weird behaviour. Doing p // p a second time gives 0. Doing p / p causes a segmentation fault and crashes Sage. Vincent Macri (He/Him) On 2024-11-05 7:50 a.m., 'Martin R' via sage-devel wrote: [△EXTERNAL] I just stumbled over ``` sag

[sage-devel] division in polynomial rings

I just stumbled over ``` sage: Q. = Frac(QQ['z']) sage: R. = Q[] sage: r = x*y - (2*z-1)/(z^2+z+1) * x + y/z sage: p = r * (x + z*y - 1/z^2) sage: p // p 0*x^2*y + (0*z)*x*y^2 ``` in current develop. Does somebody have an old version of sage, so we can see whether this is a regression? -- You r