On Mon, May 28, 2018 at 9:55 AM, Franz Lehner <[email protected]> wrote: > On Mon, 28 May 2018, Bill Page wrote: >> >> That's a pity. Is the problem with the published algorithm or the source >> code? > > Factorization of noncommutative polynomials seems to be a difficult problem. > See > https://arxiv.org/abs/1706.01806 > for a recent new approach which reduces factorization to the solution > of a quadratic matrix equation, that is, a nonlinear algebraic system of > equations with many variables. > The algorithm was implemented and tested in fricas, however Groebner bases > quickly choke on the resulting equations. > > Franz > >
Thank you very much for the reference to the paper by Konrad Schrempf. I am quite interested. Is any experimental source code available? Regards. -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
