Shapiro polynomials

In mathematics, the Shapiro polynomials are a sequence of polynomials which were first studied by Harold S. Shapiro in 1951 when considering the magnitude of specific trigonometric sums.^[1] In signal processing, the Shapiro polynomials have good autocorrelation properties and their values on the unit circle are small.^[2] The first few members of the sequence are:

${\displaystyle {\begin{aligned}P_{1}(x)&{}=1+x\\P_{2}(x)&{}=1+x+x^{2}-x^{3}\\P_{3}(x)&{}=1+x+x^{2}-x^{3}+x^{4}+x^{5}-x^{6}+x^{7}\\...\\Q_{1}(x)&{}=1-x\\Q_{2}(x)&{}=1+x-x^{2}+x^{3}\\Q_{3}(x)&{}=1+x+x^{2}-x^{3}-x^{4}-x^{5}+x^{6}-x^{7}\\...\\\end{aligned}}}$

where the second sequence, indicated by Q, is said to be complementary to the first sequence, indicated by P.

Construction[]

The Shapiro polynomials P_n(z) may be constructed from the Golay–Rudin–Shapiro sequence a_n, which equals 1 if the number of pairs of consecutive ones in the binary expansion of n is even, and −1 otherwise. Thus a₀ = 1, a₁ = 1, a₂ = 1, a₃ = −1, etc.

The first Shapiro P_n(z) is the partial sum of order 2ⁿ − 1 (where n = 0, 1, 2, ...) of the power series

f(z) := a₀ + a₁ z + a₂ z² + ...

The Golay–Rudin–Shapiro sequence {a_n} has a fractal-like structure – for example, a_n = a_2n – which implies that the subsequence (a₀, a₂, a₄, ...) replicates the original sequence {a_n}. This in turn leads to remarkable functional equations satisfied by f(z).

The second or complementary Shapiro polynomials Q_n(z) may be defined in terms of this sequence, or by the relation Q_n(z) = (1-)ⁿz^2n-1P_n(-1/z), or by the recursions

${\displaystyle P_{0}(z)=1;~~Q_{0}(z)=1;}$

${\displaystyle P_{n+1}(z)=P_{n}(z)+z^{2^{n}}Q_{n}(z);}$

${\displaystyle Q_{n+1}(z)=P_{n}(z)-z^{2^{n}}Q_{n}(z).}$

Properties[]

Zeroes of the polynomial of degree 255

The sequence of complementary polynomials Q_n corresponding to the P_n is uniquely characterized by the following properties:

• (i) Q_n is of degree 2ⁿ − 1;
• (ii) the coefficients of Q_n are all 1 or −1, and its constant term equals 1; and
• (iii) the identity |P_n(z)|² + |Q_n(z)|² = 2^(n + 1) holds on the unit circle, where the complex variable z has absolute value one.

The most interesting property of the {P_n} is that the absolute value of P_n(z) is bounded on the unit circle by the square root of 2^(n + 1), which is on the order of the L² norm of P_n. Polynomials with coefficients from the set {−1, 1} whose maximum modulus on the unit circle is close to their mean modulus are useful for various applications in communication theory (e.g., antenna design and data compression). Property (iii) shows that (P, Q) form a Golay pair.

These polynomials have further properties:^[3]

${\displaystyle P_{n+1}(z)=P_{n}(z^{2})+zP_{n}(-z^{2});\,}$

${\displaystyle Q_{n+1}(z)=Q_{n}(z^{2})+zQ_{n}(-z^{2});\,}$

${\displaystyle P_{n}(z)P_{n}(1/z)+Q_{n}(z)Q_{n}(1/z)=2^{n+1};\,}$

${\displaystyle P_{n+k+1}(z)=P_{n}(z)P_{k}(z^{2^{n+1}})+z^{2^{n}}Q_{n}(z)P_{k}(-z^{2^{n+1}});\,}$

${\displaystyle P_{n}(1)=2^{\lfloor (n+1)/2\rfloor };{~}{~}P_{n}(-1)=(1+(-1)^{n})2^{\lfloor n/2\rfloor -1}.\,}$

See also[]

• Littlewood polynomials

Notes[]

References[]

• Borwein, Peter B (2002). Computational Excursions in Analysis and Number Theory. Springer. ISBN 978-0-387-95444-8. Retrieved 2007-03-30. Chapter 4.
• Mendès France, Michel (1990). "The Rudin-Shapiro sequence, Ising chain, and paperfolding". In Berndt, Bruce C.; Diamond, Harold G.; Halberstam, Heini; et al. (eds.). Analytic number theory. Proceedings of a conference in honor of Paul T. Bateman, held on April 25-27, 1989, at the University of Illinois, Urbana, IL (USA). Progress in Mathematics. Vol. 85. Boston: Birkhäuser. pp. 367–390. ISBN 978-0-8176-3481-0. Zbl 0724.11010.