Factorization of integer-valued polynomials with square-free denominator

From MaRDI portal




Abstract: We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial f(X)=g(X)/dinQ[X], where and dinN is square-free, assuming that the factorization of g(X) in and d in is known. We translate this problem into a combinatorial one.











This page was built for publication: Factorization of integer-valued polynomials with square-free denominator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245122)