Derandomization of Sparse Cyclotomic Integer Zero Testing

The zero testing and sign determination problems of real algebraic numbers of high extension degree are important in computational complexity and numerical analysis. In this paper we concentrate an sparse cyclotomic integers. Given an integer n and a sparse polynomial f(x) = C
_k
x
^e(k)
+ c
_k-1
x
^e(k-1)
+ ... + c
₁
x
^e(1)
over Z, we present a deterministic polynomial time algorithm to decide whether f(w
_n
) is zero or not, where f(w
_n
) denotes the n-th primitive root of unity e
^{2piradic(-1/n)}
. All previously known algorithms are either randomized, or do not run in polynomial time. As a side result, we prove that if n is free of prime factors less than k + 1, there exist k field automorphisms sigma
₁
, sigma
₂
, ... , sigma
_k
in the Galois group Gal (Q(w
_n
)/Q) such that for any nonzero integers c
₁
, c
₂
... , c
_k
and for any integers 0 les e
₁
< e
₂
< ... < e
_k
< n, there exists i so that |sigma
_i
(c
_k
w
_n

^ek
+ c
_k-1
w
_n

^e(k-1)
+ ... + c
₁
w
_n

^e(1)
) | ges 1/2
<sup>(k(2)log

n+klogk)</sup>
.