Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial

We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtained by investigation of the structure of the splitting field of the polynomial. By this investigate ion, we found also an improved bound for the least common multiple of the orders of roots of unity appearing as quotients of distinct roots.

• Type: Conference
• Year: 1995
• Where: ISSAC
• Authors: Kazuhiro Yokoyama, Ziming Li, István Nemes
• Keywords: Distinct Roots, Efficient Algorithm, Integral Polynomial, ISSAC 1995, Mathematics