A polynomial inequality (and some whining)

June 15th, 2008 ~ Posted in: Mathematics

Arghhh!!! I have a meeting tomorrow with my advisor to discuss my progress in research over the past month or so, and I have nothing interesting to mention– partly because I haven’t spent as much time as I could have, but mostly just because I’m slow and dense. I just gave up on the two problems I’ve been looking at, since I’ve gotten nowhere on those, and am now reading his paper on the linear independence of spikes and sines so I can work on another idea he suggested. Namely, to adapt the technique used in the paper to get a bound on the expected spectral norm of a random rectangular submatrix of the Fourier matrix. I can’t get anything done on this tonight besides reading, but it looks interesting.

Question of the night: Let  p(t) = \sum_{k=0}^r c_k t^k , show that the coefficients of the polynomial p satisfy the inequality
 |c_k| \leq \frac{r^k}{k!} \max_{|t| \leq 1} |p(t)| \leq e^r \max_{|t| \leq 1} |p(t)|.

It may help to look up Markov’s inequality for polynomials (bounding the derivatives of a polynomial in terms of the Chebyshev polynomials), and try to prove that.

This entry was posted on Sunday, June 15th, 2008 at 6:36 pm and is filed under Mathematics. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

Leave a Reply