Reciprocal polynomial

Template:Short description Template:MOS In algebra, given a polynomial

$p(x)=a_0+a_{1}x+a_2{x}^2+\cdots +a_n{x}^n,$

with coefficients from an arbitrary field, its reciprocal polynomial or reflected polynomial, denoted by p^∗ or p^R, is the polynomial

$p^{*}(x)=a_n+a_{n-1}x+\cdots +a_0{x}^n=x^{n}p(x^{-1}).$

That is, the coefficients of p^∗ are the coefficients of p in reverse order. Reciprocal polynomials arise naturally in linear algebra as the characteristic polynomial of the inverse of a matrix.

In the special case where the field is the complex numbers, when

$p(z)=a_0+a_{1}z+a_2{z}^2+\cdots +a_n{z}^n,$

the conjugate reciprocal polynomial, denoted p^†, is defined by,

$p^{†}(z)=\overline{a_n}+\overline{a_{n-1}}z+\cdots +\overline{a_0}{z}^n=z^n\overline{p({\overline{z}}^{-1})},$

where $\overline{a_i}$ denotes the complex conjugate of $a_i$, and is also called the reciprocal polynomial when no confusion can arise.

A polynomial p is called self-reciprocal or palindromic if p(x) = p^∗(x). The coefficients of a self-reciprocal polynomial satisfy a_i = a_n−i for all i.

Properties

Reciprocal polynomials have several connections with their original polynomials, including:

1. deg p = deg p^∗ if $a_0$ is not 0.
2. p(x) = xⁿp^∗(x⁻¹).
3. For α is a root of a polynomial p if and only if α⁻¹ is a root of p^∗ or if $\alpha =0$ and $p^{*}$ is of lower degree than $p$.
4. If x ∤ p(x) then p is irreducible if and only if p^∗ is irreducible.
5. p is primitive if and only if p^∗ is primitive.

Other properties of reciprocal polynomials may be obtained, for instance:

• A self-reciprocal polynomial of odd degree is divisible by x+1, hence is not irreducible if its degree is > 1.

Palindromic and antipalindromic polynomials

A self-reciprocal polynomial is also called palindromic because its coefficients, when the polynomial is written in the order of ascending or descending powers, form a palindrome. That is, if

$P(x)=\sum _{i=0}^n{a}_i{x}^i$

is a polynomial of degree n, then P is palindromic if a_i = a_n−i for i = 0, 1, ..., n.

Similarly, a polynomial P of degree n is called antipalindromic if a_i = −a_n−i for i = 0, 1, ..., n. That is, a polynomial P is antipalindromic if P(x) = –P^∗(x).

Examples

From the properties of the binomial coefficients, it follows that the polynomials P(x) = (x + 1)ⁿ are palindromic for all positive integers n, while the polynomials Q(x) = (x – 1)ⁿ are palindromic when n is even and antipalindromic when n is odd.

Other examples of palindromic polynomials include cyclotomic polynomials and Eulerian polynomials.

Properties

• If a is a root of a polynomial that is either palindromic or antipalindromic, then Template:Sfrac is also a root and has the same multiplicity.
• The converse is true: If for each root a of polynomial, the value Template:Sfrac is also a root of the same multiplicity, then the polynomial is either palindromic or antipalindromic.
• For any polynomial q, the polynomial q + q^∗ is palindromic and the polynomial q − q^∗ is antipalindromic.
• It follows that any polynomial q can be written as the sum of a palindromic and an antipalindromic polynomial, since q = (q + q^∗)/2 + (q − q^∗)/2.
• The product of two palindromic or antipalindromic polynomials is palindromic.
• The product of a palindromic polynomial and an antipalindromic polynomial is antipalindromic.
• A palindromic polynomial of odd degree is a multiple of x + 1 (it has –1 as a root) and its quotient by x + 1 is also palindromic.
• An antipalindromic polynomial over a field Template:Mvar with odd characteristic is a multiple of x – 1 (it has 1 as a root) and its quotient by x – 1 is palindromic.
• An antipalindromic polynomial of even degree is a multiple of x² – 1 (it has −1 and 1 as roots) and its quotient by x² – 1 is palindromic.
• If p(x) is a palindromic polynomial of even degree 2Template:Mvar, then there is a polynomial q of degree d such that p(x) = x^dq(x + Template:Sfrac).
• If p(x) is a monic antipalindromic polynomial of even degree 2Template:Mvar over a field Template:Mvar of odd characteristic, then it can be written uniquely as p(x) = x^d(Q(x) − Q(Template:Sfrac)), where Template:Mvar is a monic polynomial of degree Template:Mvar with no constant term.
• If an antipalindromic polynomial P has even degree 2n over a field Template:Mvar of odd characteristic, then its "middle" coefficient (of power n) is 0 since a_n = −a_2n – n.

Real coefficients

A polynomial with real coefficients all of whose complex roots lie on the unit circle in the complex plane (that is, all the roots have modulus 1) is either palindromic or antipalindromic.

Conjugate reciprocal polynomials

A polynomial is conjugate reciprocal if $p(x)\equiv p^{†}(x)$ and self-inversive if $p(x)=\omega p^{†}(x)$ for a scale factor ω on the unit circle.

If p(z) is the minimal polynomial of z₀ with Template:Abs = 1, z₀ ≠ 1, and p(z) has real coefficients, then p(z) is self-reciprocal. This follows because

$z_0^n\overline{p(1/\overline{z_0})}=z_0^n\overline{p(z_0)}=z_0^n\overline{0}=0.$

So z₀ is a root of the polynomial $z^n\overline{p({\overline{z}}^{-1})}$ which has degree n. But, the minimal polynomial is unique, hence

$cp(z)=z^n\overline{p({\overline{z}}^{-1})}$

for some constant c, i.e. $c{a}_i=\overline{a_{n-i}}=a_{n-i}$. Sum from i = 0 to n and note that 1 is not a root of p. We conclude that c = 1.

A consequence is that the cyclotomic polynomials Φ_n are self-reciprocal for n > 1. This is used in the special number field sieve to allow numbers of the form x¹¹ ± 1, x¹³ ± 1, x¹⁵ ± 1 and x²¹ ± 1 to be factored taking advantage of the algebraic factors by using polynomials of degree 5, 6, 4 and 6 respectively – note that φ (Euler's totient function) of the exponents are 10, 12, 8 and 12.

Per Cohn's theorem, a self-inversive polynomial has as many roots in the unit disk $\{z\in \mathbb{ℂ}:|z|<1\}$ as the reciprocal polynomial of its derivative.

Application in coding theory

The reciprocal polynomial finds a use in the theory of cyclic error correcting codes. Suppose xⁿ − 1 can be factored into the product of two polynomials, say xⁿ − 1 = g(x)p(x). When g(x) generates a cyclic code C, then the reciprocal polynomial p^∗ generates C^⊥, the orthogonal complement of C. Also, C is self-orthogonal (that is, C ⊆ C^⊥), if and only if p^∗ divides g(x).

See also

• Cohn's theorem

External links

• Template:MathPages