Shapiro polynomials

The Shapiro polynomials Pn(z) may be constructed from the Golay–Rudin–Shapiro sequence an, which equals 1 if the number of pairs of consecutive ones in the binary expansion of n is even, and −1 otherwise. Thus a0 = 1, a1 = 1, a2 = 1, a3 = −1, etc. The first Shapiro Pn(z) is the partial sum of order 2n − 1 (where n = 0, 1, 2, ...) of the power series :f(z) := a0 + a1 z + a2 z2 + ... The Golay–Rudin–Shapiro sequence {an} has a fractal-like structure – for example, an = a2n – which implies that the subsequence (a0, a2, a4, ...) replicates the original sequence {an}. This in turn leads to remarkable functional equations satisfied by f(z). The second or complementary Shapiro polynomials Qn(z) may be defined in terms of this sequence, or by the relation Qn(z) = (−1)nz2n−1Pn(−1/z), or by the recursions :P_0(z)=1; ~~ Q_0(z) = 1 ; :P_{n+1}(z) = P_n(z) + z^{2^n} Q_n(z) ; :Q_{n+1}(z) = P_n(z) - z^{2^n} Q_n(z) . ==Properties==

The sequence of complementary polynomials Qn corresponding to the Pn is uniquely characterized by the following properties: • (i) Qn is of degree 2n − 1; • (ii) the coefficients of Qn are all 1 or −1, and its constant term equals 1; and • (iii) the identity |Pn(z)|2 + |Qn(z)|2 = 2(n + 1) holds on the unit circle, where the complex variable z has absolute value one. The most interesting property of the {Pn} is that the absolute value of Pn(z) is bounded on the unit circle by the square root of 2(n + 1), which is on the order of the L2 norm of Pn. 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: : P_{n+1}(z) = P_n(z^2) + z P_n(-z^2) ; \, : Q_{n+1}(z) = Q_n(z^2) + z Q_n(-z^2) ; \, :P_n(z) P_n(1/z) + Q_n(z) Q_n(1/z) = 2^{n+1} ; \, :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}}) ; \, :P_n(1) = 2^{\lfloor (n+1)/2 \rfloor}; {~}{~} P_n(-1) = (1+(-1)^n)2^{\lfloor n/2 \rfloor - 1} . \, ==See also==