The maximum of a polynomial on the unit circle - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-21T01:42:00Z http://mathoverflow.net/feeds/question/64099 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/64099/the-maximum-of-a-polynomial-on-the-unit-circle The maximum of a polynomial on the unit circle Seva 2011-05-06T09:17:32Z 2012-08-04T17:13:04Z <p>Encouraged by the progress made in a <a href="http://mathoverflow.net/questions/63525" rel="nofollow">recently posted MO problem</a>, here is a "conceptually related" problem originating from <a href="http://www.math.haifa.ac.il/~seva/Papers/polymax.dvi" rel="nofollow">a 2003 joint paper</a> of Sergei Konyagin and myself. </p> <p>Suppose we are given $n$ points <code>$z_1,...,z_n$</code> on the unit circle <code>$U=\{z\colon |z|=1\}$</code> and $n$ weights <code>$p_1,...,p_n\ge 0$</code> such that <code>$p_1+....+p_n=n$</code>, and we want to find yet another point <code>$z\in U$</code> to maximize the product <code>$$\prod_{i=1}^n |z-z_i|^{p_i}.$$</code> How large can we make this product by the optimal choice of $z$?</p> <blockquote> <p><strong>Conjecture.</strong> For any given <code>$z_1,...,z_n\in U$</code> and <code>$p_1,...,p_n\ge 0$</code> with <code>$p_1+...+p_n=n$</code>, there exists <code>$z\in U$</code> with <code>$$\prod_{i=1}^n |z-z_i|^{p_i} \ge 2.$$</code></p> </blockquote> <p>Here are some comments. </p> <ul> <li><p>If true, the estimate of the conjecture is best possible, as evidenced by the situation where the points are equally spaced on $U$ and all weights are equal to $1$.</p></li> <li><p><a href="http://www.math.haifa.ac.il/~seva/Papers/polymax.dvi" rel="nofollow">We were able to resolve</a> a number of particular cases; say, that where the points $z_i$ are equally spaced on $U$, and also that where all weights are equal to $1$.</p></li> <li><p>The case $n=2$ is almost trivial, but already the case $n=3$ is wide open.</p></li> <li><p>In the general case we have shown that the maximum is larger than some absolute constant exceeding $1$.</p></li> <li><p>Although this is not obvious at first glance, this conjecture is actually about the maxima of polynomials on the unit circle. </p></li> </ul> <p>I would be very interested to see any further progress!</p> http://mathoverflow.net/questions/64099/the-maximum-of-a-polynomial-on-the-unit-circle/64344#64344 Answer by Helge for The maximum of a polynomial on the unit circle Helge 2011-05-09T00:25:23Z 2011-05-09T00:25:23Z <p>Not an answer, but maybe an useful reference:</p> <p>Your statement reminds me of Schiefermayr's theorem:</p> <p>If $p_n$ is a degree $n$ polynomial and $\Sigma\subseteq\mathbb{R}$. Then $$\|p_n\|_{L^{\infty}(\Sigma)} \geq 2 Cap(\Sigma)^n$$ where $Cap(\Sigma)$ is the logarithmic capacity of $\Sigma$, e.g. $Cap([-2,2]) = 1$.</p> <p>This is Corollary~5.7.7. in Barry Simon's book: Szego's Theorem and its decendents.</p> <hr> <p>Unfortunately, this does not apply in your case, since it requires the work with subsets of the real line. However, you are close to this situation, since you require the zeros of your polynomial to be on the unit circle.</p> http://mathoverflow.net/questions/64099/the-maximum-of-a-polynomial-on-the-unit-circle/65769#65769 Answer by fedja for The maximum of a polynomial on the unit circle fedja 2011-05-23T15:17:41Z 2011-05-24T18:31:28Z <p>Let's create a proof a la Koosis. All the techniques used below can be found in his book "The Logarithmic Integral". </p> <p>Take $a>1$ and put $f(z)=a\prod_j(1+z/z_j)^{p_j}$. That is a nice analytic function and, while its absolute value is somewhat hard to understand, its argument is very simple: it is an $n$-piece piecewise linear function on the circle with slope $\frac 12 n$ (with respect to the usual circle length) and jumps at $z_j$. Let $I$ be the image of one of the arcs between two adjacent points $z_j$ and $z_{j+1}$ under the mapping $z\mapsto \operatorname{arg}f(z)$. We can transplant all functions defined on the circle arc $[z_j,z_{j+1}]$ to $I$ using this mapping. Note that the integral of any function over the arc with respect to the circle length is just $2/n$ times the integral of its transplant over $I$ with respect to the line length.</p> <p>Let $\Phi$ be the transplant of $|f|$. Assume that $\Phi&lt;2$ on $I$. The transplant of $f$ is then just $F(t)=\Phi(t)e^{it}$. The key observation is the following: $$\int_I \log|2-F(t)|dt\ge \log 2(|I|-\pi).$$ Assuming that it is true, we conclude that the full integral of $\log|2-f|$ over the unit circle is at least $2/n$ times the sum of the right hand sides over the intervals corresponding to all arcs, which is $0$. On the other hand, if $a>1$, then $\log|2-f(0)|=\log|2-a|&lt;0$, so $2-f$ must have a root inside the disk and the maximum principle finishes the story.</p> <p>Now let us prove the observation claim. The only thing we really know about $\Phi$ is that it is log-concave and, thereby, unimodal. Fortunately, that's all we need. So, in what follows, $\Phi$ will be just any unimodal function on $I$ with values in $[0,2]$. Since we can always extend $\Phi$ by $0$ outside $I$, we can switch to any larger interval we want without making the inequality easier. So, WLOG, $I=[-2\pi n-\frac\pi 2,2\pi n+\frac\pi 2]$</p> <p>Now, let us observe that for every fixed $t$, the integrand is minimized for $\Phi(t)=2\max(0,\cos t)$ (that is just the nearest point on the line) and that the farther we go away from this optimal value, the larger the integrand is. Therefore, to minimize the left hand side, we need to stay as close to the black regime on the picture (the graph of $2\cos_+ t$) as we can. </p> <p><br/> <img src="http://www.artofproblemsolving.com/Wiki/images/f/f5/Seva.jpg" alt="Regime comparison"> <br/></p> <p>Suppose that the actual $\Phi$ is given by the blue line. Then, replacing $\Phi$ by the red line $\Psi$, we come closer to the optimum at every point. But the red line consists of several full periods (horizontal pieces) and several pieces that together constitute one full positive arc of $\cos t$. Now, each full period means running over some circle around the origin, so the average value of $\log|2-\Psi(t)e^{it}|$ over each full period is exactly $\log 2$. At last, the $2\cos t$ part gives $\int_0^\pi\log (2|\sin t|)dt=0$, which is exactly the loss of $\pi \log 2$ compared to $\log 2$ times its length $\pi$. </p> <p>That's it. Feel free to comment and/or ask questions.</p> http://mathoverflow.net/questions/64099/the-maximum-of-a-polynomial-on-the-unit-circle/65800#65800 Answer by David Speyer for The maximum of a polynomial on the unit circle David Speyer 2011-05-23T22:14:03Z 2011-05-24T18:47:33Z <p>Here is an observation that didn't get me very far. Let $p$ have degree $n$ and have $r$ distinct roots, all on the unit circle. Call these roots $e^{i \theta_j}$, where $\theta_k$ has multiplicity $c_j$. </p> <p>Set <code>$$q(u) = \frac{1}{n} \sum_{j=1}^r \left( c_j \left( u + e^{i \theta_j} \right) \prod_{\substack{1 \leq k \leq r \\ k \neq j}} \left( u - e^{i \theta_k} \right) \right).$$</code> Then $q$ is a monic polynomial of degree $r$, all of whose roots are on the unit circle. They occur at precisely the places where $|p(e^{i \phi})|$ has a local maximum. Your goal is to show that, at one of these local maxima, we have $|p| \geq 2^{n/r}$.</p> <p>I had a detailed computation of this written out, but I couldn't find a way to make it useful, so I'm recording the formula in case it helps someone else. My plan was to show that <code>$\prod_{\{\phi : q(e^{i \phi})=0\}} |p(e^{i \phi})| \geq 2^n$</code>, but this inequality turned out to be false; if all the $\theta$'s are very close together, then one of the local maxima of $p$ is near $2^n$ but the other local maxima can be arbitrarily small. </p> http://mathoverflow.net/questions/64099/the-maximum-of-a-polynomial-on-the-unit-circle/103918#103918 Answer by Alexandre Eremenko for The maximum of a polynomial on the unit circle Alexandre Eremenko 2012-08-04T07:33:04Z 2012-08-04T17:13:04Z <p>Here is a second proof. Let $$H(z)=\prod_j|z-z_j|^{p_j}.$$ Let $$F(z)=\prod_j\left((z-z_j)(1/z-\bar{z}_j)\right)^{p_j/n},\quad |z|\geq 1.$$ It is easy to see that: $$|F(z)|=H^{2/n}(z),\quad |z|=1,$$ and that $F$ maps conformally the exterior of the unit disc on the exterior of a "star" consisting of $n$ straight segments $[0,a_j]$ with some complex $a_j$. Moreover, $F(z)\sim z$ as $z$ tends to infinity.</p> <p>Now we see that the result is equivalent to the following theorem of Dubinin: Let $K$ be the union of some intervals of the form $[0,a_j]$, and suppose that capacity of $K$ is $1$. Then $\max_j|a_j|$ takes its minimal value when the star is symmetric: all |a_j| are equal and the angles between adjacent intervals are equal.</p> <p>The reference is Dubinin, Uspekhi Mat. Nauk (=Russian Math. Surveys), 49 (1994). Fedja's proof is much simpler, so it is a new proof of Dubinin's theorem.</p>