arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.04713math.NTcs.CCcs.SCmath.AC
收藏

环$\mathbb{Z}/p^2\mathbb{Z}$上多项式根的计数

Counting Roots of Polynomials over $\mathbb{Z}/p^2\mathbb{Z}$

Trajan Hammonds, Jeremy Johnson, Angela Patini, Robert M. Walker

摘要:

直到最近,除了域之外,唯一已知的在素幂环上求多项式根的方法是蛮力。其中一个原因是缺乏除法算法,阻碍了最大公因数的使用。固定一个素数$p \in \mathbb{Z}$和$f \in ( \mathbb{Z}/p^n \mathbb{Z} ) [x]$任何非零多项式的次数$d$,其系数不都是可被$p$整除的。对于$n=2$,我们证明了在$(d+\operatorname{size}(f)+\log{p})$中的时间多项式内计算$\mathbb{Z}/p^2\mathbb{Z}$中的$f$的根的一个新的有效算法,并记录了Cheng,Gao,Rojas和Wan提出的根数的简明公式.

英文摘要:

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors. Fix a prime $p \in \mathbb{Z}$ and $f \in ( \mathbb{Z}/p^n \mathbb{Z} ) [x]$ any nonzero polynomial of degree $d$ whose coefficients are not all divisible by $p$. For the case $n=2$, we prove a new efficient algorithm to count the roots of $f$ in $\mathbb{Z}/p^2\mathbb{Z}$ within time polynomial in $(d+\operatorname{size}(f)+\log{p})$, and record a concise formula for the number of roots, formulated by Cheng, Gao, Rojas, and Wan.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑