Talk:Littlewood polynomial
Latest comment: 13 years ago by 91.122.19.28 in topic Lower bound in Littlewood problem
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Lower bound in Littlewood problem edit
Mentioned part of Littlewood problem looks completely wrong. Statement "No sequence is known (as of 2008) which satisfies the lower bound." is evident lie, because any Littlewood polynomial will satisfy mentioned inequality with c_1 = 1. So Rudin-Shapiro polynomials will be solution of "Littlewood problem" in this formulation. Somebody who knows correct formulation of the problem please fix this article. —Preceding unsigned comment added by 91.122.19.28 (talk) 18:40, 29 August 2010 (UTC)