You can edit almost every page by Creating an account and confirming your email.

Cyclotomic pre-polynomial

From EverybodyWiki Bios & Wiki


For every n3, corresponding to the cyclotomic polynomial Φn(x) of degree φ(n) there exists a unique polynomial Ψn(x) of degree φ(n)/2 such that xφ(n)/2Ψn(x+1x)=Φn(x), where φ(n) denotes Euler's totient function.

The polynomials Ψn(x) may be referred to as cyclotomic pre-polynomials, since the cyclotomic polynomials can be obtained from them via a well-defined mapping.

Alternatively, the cyclotomic pre-polynomial Ψn(x) can be defined as Ψn(x)=(x2cos2kπn), where product is taken over all positive integers k<n/2 that are relative prime to n.

For n up to 30, the cyclotomic pre-polynomials are:

Ψ3(x)=x+1Ψ4(x)=xΨ5(x)=x2+x1Ψ6(x)=x1Ψ7(x)=x3+x22x1Ψ8(x)=x22Ψ9(x)=x33x+1Ψ10(x)=x2x1Ψ11(x)=x5+x44x33x2+3x+1Ψ12(x)=x23Ψ13(x)=x6+x55x44x3+6x2+3x1Ψ14(x)=x3x22x+1Ψ15(x)=x4x34x2+4x+1Ψ16(x)=x44x2+2Ψ17(x)=x8+x77x66x5+15x4+10x310x24x+1Ψ18(x)=x33x1Ψ19(x)=x9+x88x77x6+21x5+15x420x310x2+5x+1Ψ20(x)=x45x2+5Ψ21(x)=x6x56x4+6x3+8x28x+1Ψ22(x)=x5x44x3+3x2+3x1Ψ23(x)=x11+x1010x99x8+36x7+28x656x535x4+35x3+15x26x1Ψ24(x)=x44x2+1Ψ25(x)=x1010x8+35x6+x550x45x3+25x2+5x1Ψ26(x)=x6x55x4+4x3+6x23x1Ψ27(x)=x99x7+27x530x3+9x+1Ψ28(x)=x67x4+14x27Ψ29(x)=x14+x1313x1212x11+66x10+55x9165x8120x7+210x6+126x5126x456x3+28x2+7x1Ψ30(x)=x4+x34x24x+1.

Applications

It is well known that cyclotomic polynomials are monic polynomials with integer coefficients that are irreducible over the field of the rational numbers. From this fact it obviously follows that cyclotomic pre-polynomials are also irreducible over the field of the rational numbers.

Because of their irreducibility, both cyclotomic polynomials and cyclotomic pre-polynomials are useful in the irreducible factorization of polynomials.

Examples of their application for irreducible factorization:

1. Power functions defining complex roots of unity and their compositions

By the definition of cyclotomic polynomials, for any positive integer k xkn1=dknΦd(x).

Two examples of such compositions are x2n+1=d3,d4n,d2nΦd(x) and k=0nx2k=x2n+21x21=d3,d2n+2Φd(x).

2. Chebyshev polynomials

For the purpose of factorization, it is more convenient to first consider the following polynomials before factoring the original Chebyshev polynomials Tn(x) and Un(x).

Vieta-Lucas polynomial is defined by Cn(x)=2Tn(x2) for which we also have 2cosnϑ=Cn(2cosϑ), and the Vieta-Fibonacci polynomial is defined by Sn(x)=Un(x2) for which we also have sin((n+1)ϑ)=sinϑSn(2cosϑ).

The irreducible factorization of these polynomials are ase follows. Cn(x)=d3,d4n,d2nΨd(x) and Sn(x)=d3,d2n+2Ψd(x).

Now, it follows directly that the Chebyshev polynomials Tn(x) and Un(x) can be factorized as follows: Tn(x)=12d3,d4n,d2nΨd(2x) and Un(x)=d3,d2n+2Ψd(2x).

By similar methods, we find that the third- and fifth kind Chebyshev polynomials, Vn(x) and Wn(x) can be factorized as follows: Vn(x)=d3,d4n+2,d2n+1Ψd(2x), and Wn(x)=d3,d2n+1Ψd(2x).

3. Factorization of shifted Chebyshev polynomials

Slightly different formulas hold depending on the parity of n.

For odd n we have Tn(x)1=(x1)d3,dn[Ψd(2x)]2 and Tn(x)+1=(x+1)d3,d2n,dn[Ψd(2x)]2, while for even n we have Tn(x)1=2(x1)(x+1)d3,dn[Ψd(2x)]2 and Tn(x)+1=12d3,d2n,dn[Ψd(2x)]2.

Pseudo cyclotomic pre-polynomials

In formulas for the trigonometric functions of multiple angles, replacing the trigonometric functions with the corresponding hyperbolic functions often yields expressions that remain valid, either unchanged or with only minor modifications. For example: 2coshnϑ=Cn(2coshϑ).

In some other cases, the formula should be modified by replacing all coefficients of the polynomial Cn(x) or Sn(x) with their absolute values. Let us denote the resulting polynomials by Cn(x) and Sn(x), respectively, which can also be formally defined by formulas Cn(x)=(i)nCn(ix), and similarly Sn(x)=(i)nSn(ix). With this notation it can be shown that for odd n, 2sinhnϑ=Cn(2sinhϑ), while for even n, 2coshnϑ=Cn(2sinhϑ) holds.

An example with the use of Sn(x) is as follows: for odd n, sinh((n+1)ϑ)=coshϑSn(2sinhϑ), while for even n, cosh((n+1)ϑ)=coshϑSn(2sinhϑ) holds.

The factors in the irreducible factorizations of Cn(x) and Sn(x) are not cyclotomic pre-polynomials, but rather another type of polynomial resembling them, which we call pseudo cyclotomic pre-polynomials and denote by Ψn(x).

Their definition is as follows: Ψ4(x)=Ψ4(x)=x; Ψ4d(x)=|Ψ4d(ix)|, or alternatively Ψ4d(x)=0<k<dgcd(k,4d)=1[x2+4cos2(kπ2d)] for any d>1 integer; Ψd(x)=|Ψd(ix)Ψ2d(ix)|, or alternatively Ψd(x)=0<k<d/2gcd(k,d)=1[x2+4cos2(2kπd)] for any odd d greater than 1.

The expression Ψd(x) cannot be interpreted in the case when d2(mod4).

Similarly to the cyclotomic polynomials and cyclotomic pre-polynomials, the pseudo cyclotomic pre-polynomials also have only integer coefficients and are irreducible over the field of the rational numbers.

For n up to 27, the pseudo cyclotomic pre-polynomials are:

Ψ3(x)=x2+1Ψ4(x)=xΨ5(x)=x4+3x2+1Ψ7(x)=x6+5x4+6x2+1Ψ8(x)=x2+2Ψ9(x)=x6+6x4+9x2+1Ψ11(x)=x10+9x8+28x6+35x4+15x2+1Ψ12(x)=x2+3Ψ13(x)=x12+11x10+45x8+84x6+70x4+21x2+1Ψ15(x)=x8+9x6+26x4+24x2+1Ψ16(x)=x4+4x2+2Ψ17(x)=x16+15x14+91x12+286x10+495x8+462x6+210x4+36x2+1Ψ19(x)=x18+17x16+120x14+455x12+1001x10+1287x8+924x6+330x4+45x2+1Ψ20(x)=x4+5x2+5Ψ21(x)=x12+13x10+64x8+146x6+148x4+48x2+1Ψ23(x)=x22+21x20+190x18+969x16+3060x14+6188x12+8008x10+6435x8+3003x6+715x4+66x2+1Ψ24(x)=x4+4x2+1Ψ25(x)=x20+20x18+170x16+800x14+2275x12+4003x10+4280x8+2605x6+775x4+75x2+1Ψ27(x)=x18+18x16+135x14+546x12+1287x10+1782x8+1386x6+540x4+81x2+1

From all of the above, we obtain the irreducible factorization of Cn(x) and Sn(x) as follows: Cn(x)=d|n,2dnΨ4d(x) and Sn(x)=d3,d|2n+2,d≢2(mod4)Ψd(x).

For several publicatons using cyclotomic pre-polynomials, see [1], [2]. [3], [4].


This article "Cyclotomic pre-polynomial" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Cyclotomic pre-polynomial. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.

  1. Kearnes, K., Kiss, E. and Szendrei, Á. (2010): Gauss-egészek és Dirichlet tétele, 2. rész (Gaussian integers and Dirichlet's theorem, Part 2), in Hungarian, Középiskolai Matematikai és Fizikai Lapok (April 2010)
  2. Kéri, Gerzson (2021): Compressed Chebyshev Polynomials and Multiple-Angle Formulas, Omniscriptum Publishing Company, ISBN 978-620-0-62498-7.
  3. Kéri, G. (2022): The factorization of compressed Chebyshev polynomials and other polynomials related to multiple-angle formulas, Annales Universitatis Scientiarum Budapestinensis de Rolando Eotvos Nominatae Sectio Computatorica, 53 (2022) 93-108.
  4. Kéri Gerzson (2025): Többszörös szögek szögfüggvényeit kifejező polinomok néhány fajtája direktben és faktorizáltan (Some types of polynomials expressing the trigonometric functions of multiple angles in a direct and factored form), in Hungarian, Matematikai Lapok, 25 (2020) issue 2, pp. 2-51.