In algebra, the reciprocal polynomial p∗ of a polynomial p of degree n with coefficients from an arbitrary field, such as
Contents
- Properties
- Palindromic and antipalindromic polynomials
- General properties
- Real coefficients
- Conjugate reciprocal polynomials
- Application in coding theory
- References
is the polynomial
Essentially, the coefficients are written in reverse order. They arise naturally in linear algebra as the characteristic polynomial of the inverse of a matrix.
In the special case that the polynomial p has complex coefficients, that is,
the conjugate reciprocal polynomial, p† given by,
where
A polynomial p is called self-reciprocal if p(x) = p∗(x).
The coefficients of a self-reciprocal polynomial satisfy ai = an−i, and in this case p is also called a palindromic polynomial. In the conjugate reciprocal case, the coefficients must be real to satisfy the condition.
Properties
Reciprocal polynomials have several connections with their original polynomials, including:
- α is a root of polynomial p if and only if α−1 is a root of p∗.
- If p(x) ≠ x then p is irreducible if and only if p∗ is irreducible.
- p is primitive if and only if p∗ is primitive.
Other properties of reciprocal polynomials may be obtained, for instance:
Palindromic and antipalindromic polynomials
A self-reciprocal polynomial is called palindromic because its coefficients, when the polynomial is written in ascending or descending order, form a palindrome. That is, if
is a polynomial of degree n, then P is palindromic if ai = an − i for i = 0, 1, ..., n. Some authors use the terms "palindromic" and "reciprocal" interchangeably.
Similarly, P, a polynomial of degree n, is called antipalindromic if ai = −an − i for i = 0, 1, ... n. That is, a polynomial P is antipalindromic if P(x) = – P∗(x).
Due to the properties of the binomial coefficients the polynomials P(x) = (x + 1 )n are palindromic for all positive integers n, while the polynomials Q(x) = (x – 1 )n are palindromic when n is even and antipalindromic when n is odd. Also, cyclotomic polynomials are palindromic.
General properties
- If a is a root of a polynomial that is either palindromic or antipalindromic, then 1/a is also a root and has the same multiplicity.
- The converse is true: If a polynomial is such that if a is a root then 1/a 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.
- Any polynomial q can be written as the sum of a palindromic and an antipalindromic polynomial.
- 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 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 x2 – 1 (it has -1 and 1 as a roots) and its quotient by x2 – 1 is palindromic.
- If p(x) is a palindromic polynomial of even degree 2d, then there is a polynomial q of degree d such that p(x) = xdq(x + 1/x).
- If p(x) is a monic antipalindromic polynomial of even degree 2d over a field k with odd characteristic, then it can be written uniquely as p(x) = xd (Q(x) − Q(1/x)), where Q is a monic polynomial of degree d with no constant term.
It follows from the definition that if P is of even degree n (so it has an odd number of terms), then it can only be antipalindromic when the "middle" term is 0, i.e., am = −an – m, where n = 2m.
Real coefficients
A polynomial with real coefficients all of whose complex roots lie on the unit circle in the complex plane (all the roots are unimodular) is either palindromic or antipalindromic.
Conjugate reciprocal polynomials
A polynomial is conjugate reciprocal if
If p(z) is the minimal polynomial of z0 with | z0 | = 1, z0 ≠ 1, and p(z) has real coefficients, then p(z) is self-reciprocal. This follows because
So z0 is a root of the polynomial
for some constant c, i.e.
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 x11 ± 1, x13 ± 1, x15 ± 1 and x21 ± 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.
Application in coding theory
The reciprocal polynomial finds a use in the theory of cyclic error correcting codes. Suppose xn − 1 can be factored into the product of two polynomials, say xn − 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).