Harmonic analysis on Euclidean spaces Trigonometric polynomials and extremal problems Example
Rudin–Shapiro polynomials
Builds on Littlewood polynomial
Example
Define polynomials and by and, for , These are the Rudin–Shapiro polynomials. By induction, and have degree , and all of their coefficients are or . Indeed fills the coefficients of and fills those of . So they are Littlewood polynomials. The first ones are , and .
For , the parallelogram law with gives Hence , and
Remarks
Since the mean square of on the circle is , the maximum is at most times the root mean square. For a polynomial with coefficients , the maximum on the circle is always at least , so this is optimal up to the factor . A random choice of signs typically gives a maximum of order , so the Rudin–Shapiro signs are much better than random. The coefficients of the form the Rudin–Shapiro sequence, an automatic sequence.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Littlewood polynomial concept
- Rudin–Shapiro polynomials example
Further reading
About this page
| Tag | PSAX8W3ZYV |
|---|---|
| URI | m2://PSAX8W3ZYV |
| Kind | example |
| Writing | W0 stub |
| MSC | 42A05, 11B83 |
| Instance of | Littlewood polynomial |
| Uses | Littlewood polynomial |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.