Let beαalgebraic integer of degree d, not 0 or a root of unity, all of whose conjugatesαi are confined to a set Sθ= {αi∈C : |arg(αi)|≤θ}, 0 <θ< (?), i = 1,2,…, d. P(x) = a0xd + a1xd-1 +…+ ad = a0âˆi=1d(x-αi) is the minimal polynomial ofαThen, the length ofαis given by L(P) = |a0| + |a1| +…+ |ad|=∑i=0d|ai| and the absolute length ofαis given by L(P) = L(P)?.We compute the greatest lower bound C(θ) of the absolute length L(P) ofα.As a result, We succeed in finding C(θ), 0 <θ< (?), exactly forθwith ten different values. For eachθ, the absolute length ofαall satisfy L(P)≥C(θ) except several particular algebraic integers.We use the integer transfinite diameter, auxiliary function, LLL algorithm and semiinfinitelinear programming in our computer method. All these can help us find the good values of C(θ).
|