分母无平方因子的整值多项式的因式分解
Factorization of integer-valued polynomials with square-free denominator
摘要:
我们描述了一个算法来计算一个给定的图像原始整数值多项式$f(X)=g(X)/d\in\Q[X]$,其中$g\in\Z[X]$和$d\in\N$是平方自由的,假设在$\Z[X]$和$d$在$\Z$的$g(X)$的因式分解是已知的,基本上不同的因式分解。我们把这个问题转化为一个组合问题。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。