Balancing Polynomials in the Chebyshev Norm

Publication date 11 September 2020

Abstract: Given

n

polynomials

p_{1}, d o t s, p_{n}

of degree at most

n

with

| p_{i} |_{i} n f t y l e 1

for

i i n [n]

, we show there exist signs

x_{1}, d o t s, x_{n} i n - 1, 1

so that [Big|sum_{i=1}^n x_i p_iBig|_infty < 30sqrt{n}, ] where

| p |_{i} n f t y := s u p_{| x | l e 1} | p (x) |

. This result extends the Rudin-Shapiro sequence, which gives an upper bound of

O (s q r t n)

for the Chebyshev polynomials

T_{1}, d o t s, T_{n}

, and can be seen as a polynomial analogue of Spencer's "six standard deviations" theorem.

This page was built for publication: Balancing Polynomials in the Chebyshev Norm