Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
