Minimal Polynomials of Algebraic Numbers with Rational Parameters

نویسندگان

  • KARL DILCHER
  • CHRIS SMYTH
چکیده

It is unusual for an irreducible polynomial to have a root with rational real part or with rational imaginary part. Of course, such polynomials exist: one can simply take the minimal polynomial of, say, 1+ i √ 2 or √ 2+ i. The same applies to polynomials having a root of rational modulus. But it turns out to be of interest to characterize these three kinds of polynomials. We therefore define our first family of polynomials, C1, to consist of the minimal polynomials of some algebraic number having rational real part. Our second family, C2, consists of the minimal polynomials of some algebraic number having rational imaginary part, while our third family, C3, consists of the minimal polynomials of some algebraic number having rational modulus . We describe the polynomials of each family in Sections 3, 4 and 5. Then in Sections 6, 7 and 8 we classify the polynomials belonging to two of the three families, while in Section 9 we do the same for the polynomials belonging to all three families. Section 2 contains preliminary results needed for the proofs. For a rational linear polynomial, its root has rational real part, imaginary part and modulus. An irreducible quadratic polynomial z + pz + q with rational coefficients and with discriminant ∆ = p− 4q belongs to C1 if and only if ∆ < 0, to C2 if and only if −∆ is a square (in which case it belongs to C1 ∩ C2) or ∆ > 0, and to C3 if and only if ∆ < 0 and q is a square (in which case it belongs to C1 ∩ C3). Hence it belongs to C2 ∩ C3 if and only if −∆ and q are both squares (in which case it belongs to C1 ∩ C2 ∩ C3). For −∆ = a and q = b this latter condition is 4b − a = p. This is essentially the Pythagoras equation, with solution p = u−v, a = 2uv and 2b = u+v for some rationals u and v. For the rest of the paper, therefore, we can restrict our attention to polynomials of degree at least 3.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Polynomials of Algebraic Cosine Values at Rational Multiples of π

Lehmer proved that the values of the cosine function evaluated at rational multiples of π are algebraic numbers. We show how to determine explicit, closed form expressions for the minimal polynomials of these algebraic numbers.

متن کامل

The Tangent Analogues of the Chebyshev Polynomials

We study the tangent analogues tan(n arctanx) of the Chebyshev polynomials from an algebraic viewpoint. They are rational functions of a pleasant form and enjoy several noteworthy properties: a useful composition law, their numerators pn(x) split into the minimal polynomials of the numbers tan kπ/n, they define the elements of the Galois groups of these minimal polynomials, and their algebraic ...

متن کامل

Algebraic Algorithms

This is a preliminary version of a Chapter on Algebraic Algorithms in the upcoming Computing Handbook Set Computer Science (Volume I), CRCPress/Taylor and Francis Group. Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation wit...

متن کامل

A Rational Approach to the Prelle-Singer Algorithm

The Prelle–Singer procedure (Prelle and Singer, 1983) is a development of the Darboux (1878) procedure for finding elementary first integrals of two-dimensional polynomial vector fields (P, Q) where P , Q ∈ C[x, y]. Even if P , Q have coefficients in Q, we may need to introduce algebraic numbers (e.g. i, √ 2, etc) during the computations of the irreducible Darboux polynomials fk required in ste...

متن کامل

Resultants, Resolvents and the Computation of Galois Groups

We will develop the machinery of resultants and resolvent polynomials with the ultimate goal of understanding the so-called “resolvent method” for computing Galois groups over Q. Along the way, we will encounter tangential applications of these tools, such as the determination of the minimal polynomial of, say, the sum of two algebraic numbers using resultants. In this way, this paper can serve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010