Reciprocal polynomial

In algebra, given a polynomial
:$p(x) = a_0 + a_1x + a_2x^2 + \cdots + a_nx^n,$
with coefficients from an arbitrary field, its reciprocal polynomial or reflected polynomial,* denoted by or , is the polynomial

:$p^*(x) = a_n + a_x + \cdots + a_0x^n = x^n p(x^).$

That is, the coefficients of are the coefficients of 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_1z + a_2z^2 + \cdots + a_nz^n,$

the conjugate reciprocal polynomial, denoted , is defined by,

:$p^(z) = \overline + \overlinez + \cdots + \overlinez^n = z^n\overline,$

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

A polynomial is called self-reciprocal or palindromic if .
The coefficients of a self-reciprocal polynomial satisfy for all .

Properties

Reciprocal polynomials have several connections with their original polynomials, including:
#
# .
# For is a root of a polynomial if and only if is a root of or if $\alpha = 0$ and $p ^*$ is of lower degree than $p$.
# If then is irreducible if and only if is irreducible.
# is primitive if and only if 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_^n a_ix^i$
is a polynomial of degree , then is ''palindromic'' if for .

Similarly, a polynomial of degree is called antipalindromic if for . That is, a polynomial is ''antipalindromic'' if .

Examples

From the properties of the binomial coefficients, it follows that the polynomials are palindromic for all positive integers , while the polynomials are palindromic when is even and antipalindromic when is odd.

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

Properties

* If is a root of a polynomial that is either palindromic or antipalindromic, then is also a root and has the same multiplicity.
* The converse is true: If for each root of polynomial, the value is also a root of the same multiplicity, then the polynomial is either palindromic or antipalindromic.
* For any polynomial , the polynomial is palindromic and the polynomial is antipalindromic.
* It follows that any polynomial can be written as the sum of a palindromic and an antipalindromic polynomial, since .
* 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 (it has –1 as a root) and its quotient by is also palindromic.
* An antipalindromic polynomial over a field with odd characteristic is a multiple of (it has 1 as a root) and its quotient by is palindromic.
* An antipalindromic polynomial of even degree is a multiple of (it has −1 and 1 as roots) and its quotient by is palindromic.
* If is a palindromic polynomial of even degree 2, then there is a polynomial of degree such that .
* If is a monic antipalindromic polynomial of even degree 2 over a field of odd characteristic, then it can be written uniquely as , where is a monic polynomial of degree with no constant term.
* If an antipalindromic polynomial has even degree over a field of odd characteristic, then its "middle" coefficient (of power ) is 0 since .

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 is the minimal polynomial of with , and has real coefficients, then is self-reciprocal. This follows because

:$z_0^n\overline = z_0^n\overline = z_0^n\bar = 0.$

So is a root of the polynomial $z^n\overline$ which has degree . But, the minimal polynomial is unique, hence
:$cp(z) = z^n\overline$
for some constant , i.e. $ca_i=\overline=a_$. Sum from to and note that 1 is not a root of . We conclude that .

A consequence is that the cyclotomic polynomials are self-reciprocal for . This is used in the special number field sieve to allow numbers of the form and 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 $\$ 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 can be factored into the product of two polynomials, say . When generates a cyclic code , then the reciprocal polynomial generates , the orthogonal complement of .
Also, is ''self-orthogonal'' (that is, , if and only if divides .

See also

* Cohn's theorem

Notes

References

*
*
*

External links

*
* {{MathWorld , urlname=ReciprocalPolynomial , title=Reciprocal polynomial

Polynomials