Stanislav Poslavsky

Is there any chance that this PR will be accepted soon?

Hi - Thank you for using Rings! I just made a commit which tunes heuristics allowing more modular attempt and fixes this particular case. However there always will be cases...

Hi, Takahiro! Thanks for reporting. I confirm the problem. The truth is that I need to update Rings.scaladsl for Scala 2.13; hope to finish this by the end of the...

Hi guys! Sorry for a long delay and for inconvenience. I just released an update (2.5.8) for Scala 2.13, it should work, and if not - please, let me know!...

Hi Takahiro! Internally, Factorization and GCD algorithms use random number generator to generate random substitutions. For some input polynomials there is a higher probability to meet "bad" substitutions which cause...

Hi Takahiro! Thanks for your research on the problem and for the solution. I have finally [implemented](https://github.com/PoslavskySV/rings/commit/ab602100d0ad572550a9fd44347675ba14f3c9a7) your idea with additional sort of variables by occurrences and it really speeds...

Sure, I will make a release within this week!

Hi! Currently, there is no special treatment of cyclotomic polynomials, so in this special case Rings may be a bit slow. On the other hand, cyclotomic polynomials are in my...

This is also required for Groebner bases over Z (for F4 algorithm)

EEZ-GCD works fine on this input.