Factorization of Integer-Valued Polynomials with Square-Free Denominator
Giulio Peruginelli · Communications in Algebra · 2014
We describe an algorithm to compute the different factorizations of a given image primitive integer-valued polynomial f(X) = g(X)/d ∈ ℚ[X], where g ∈ ℤ[X] and d ∈ ℕ is square-free, assuming that the factorizations of g(X) in ℤ[X] and d in ℤ are known. We translate this problem into a combinatorial one.