arXiv · 1304.7526
Factorization of integer-valued polynomials with square-free denominator
Abstract
We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of $g(X)$ in $\Z[X]$ and $d$ in $\Z$ is known. We translate this problem into a combinatorial one.
Explore related subjects
Keep this discovery
Giulio Peruginelli. 2013-04-28. Factorization of integer-valued polynomials with square-free denominator. https://doi.org/10.1080/00927872.2014.897563
Cite the original work for its findings. Save a collection to share your selection of sources.