>
> Hi,
>
>
> What is the correct way to factor polynomials in spad code?
>
ATM this is a mess. Normally you need to determine correct
factorizer. If you want something automatic, then
you may try GeneralizedMultivariateFactorize, but it works
on best effort basis: it may fail to produce factorization
if it can not find good factorizer. If base ring is
Integer, then MultivariateFactorize contains apropriate
'factor'.
>
> Assume I have some ring R (maybe Z):
>
> R : UniqueFactorizationDomain
>
That is not enough: there fields F such that factorization
in SparseUnivariatePolynomial(F) is not computable. So
we need more properties from R to be able to factor
polynomials. This is at core of current mess. There
was proposal to introduce additional property which
allows propagating polynomial factorization trough
type hierarchy (google for PolynomialFactorizationExplicit).
However, as I explaned in recent posts there is problem
with implementing it (both speed and correctness are
problematic).
--
Waldek Hebisch
[email protected]
--
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 http://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
