Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Littlewood Polynomials with Small Norm
corollary_3_1: Jedwab, Katz and Schmidt's transfer of the limit of Theorem 2.1 to the Littlewood polynomials obtained from the generalized Fekete polynomials by replacing each zero coefficient with 1, under the same hypotheses on r/p and t/p.
corollary_3_2: Jedwab, Katz and Schmidt's lower bound c^(1/4) for the limiting L4 to L2 ratio of the Littlewood polynomials g_p^(r,t) when r/p tends to a finite R and t/p to T in (0, infinity), with the equality case, and divergence of the ratio when t/p tends to infinity.
theorem_1_1: Jedwab, Katz and Schmidt's sequence of Littlewood polynomials of unbounded degree whose L4 to L2 norm ratio tends to the fourth root of c, where c < 22/19 is the smallest root of 27x^3 - 498x^2 + 1164x - 722, below the previous least known asymptotic ratio (7/6)^(1/4).
theorem_2_1: Jedwab, Katz and Schmidt's limit of the fourth power of the L4 norm of the shifted, truncated or periodically extended Fekete polynomial, divided by p^2, when r/p tends to a finite R and t/p to a finite T.
Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt, "Littlewood Polynomials with Small Norm," arXiv:1205.0260 (2012); published in Adv. Math. 241 (2013), 127--136, DOI 10.1016/j.aim.2013.03.015.
The copy read for this card is the arXiv manuscript (arXiv:1205.0260, dated 17 June 2011 and revised 25 April 2013), read in full; the page locators below are that manuscript's printed pages. The statements below and the norm identities were checked against it; the proofs have not been independently verified. The arXiv record names arXiv's non-exclusive distribution license (arXiv:1205.0260), every other right reserved.
Read status: claims checked for Theorem 1.1 (p. 2), Theorem 2.1 (p. 3) and Corollaries 3.1 and 3.2 (p. 8); the proofs (pp. 3-10) were read for their structure but not checked step by step. Result pages: Theorem 1.1 (p. 2), Theorem 2.1 (p. 3), Corollary 3.1 (p. 8), Corollary 3.2 (p. 8).
Write
where is an odd prime and is the Legendre symbol. This is a cyclic shift of the Fekete coefficient sequence, truncated if and periodically extended if . Replacing every zero coefficient by gives the Littlewood polynomial
Main results
Theorem 1.1 (statement on p. 2) constructs Littlewood polynomials of unbounded degree such that
where is the smallest root of . Numerically, and . This improves on the previously least known asymptotic ratio .
Theorem 2.1 (statement on p. 3; proof on pp. 3--6) gives the two-parameter asymptotic behind that construction. If and , then
The proof expands the quadratic character into additive characters, isolates the three root-pairing contributions to a complete quartic character sum, and uses a Weil-type bound plus Lemma 2.2 to show that the remaining term is . Corollary 3.1 (p. 8) shows that changing the sparse zero coefficients of to does not change this limit, so the formula also governs .
Corollary 3.2 (statement on p. 8; proof on pp. 8--9) optimizes the formula over the generalized Fekete family with . If and , then
Equality holds exactly when , the middle root of , and
for some . The same corollary shows that if , then the normalized norm tends to infinity. Thus Theorem 1.1 is not just an example: is the best asymptotic ratio obtainable from this shifted, truncated, or periodically extended Fekete construction when converges and tends to a positive limit or to infinity; the case is not covered.
Autocorrelation and merit factor
For a Littlewood polynomial
put for . The introduction (pp. 1--2) identifies the fourth power of the norm with the sum of squared aperiodic autocorrelations. Explicitly,
where and . The coefficient calculation supporting this identity appears again in the proof of Lemma 3.3 (p. 10): the coefficient of in is the correlation at lag , and Parseval sums the squares of these coefficients. Since , the merit factor defined in the introduction (p. 2) is
Bearing on maximum modulus
On the unit circle with normalized measure, , and the introduction (pp. 1-2) uses this monotonicity: if were bounded away from over Littlewood polynomials, then so would be , which would prove a modification of a conjecture of Erdős (cited as Ann. Polon. Math. 12 (1962) and Michigan Math. J. 4 (1957), Problem 22). That conjecture asks for with for all non-constant polynomials whose coefficients have absolute value ; the paper recalls that Kahane showed no such exists, and calls the modification restricted to Littlewood polynomials still resistant. The paper's results concern the norm only: they lower the least known asymptotic ratio to , and give no bound on .
Bears on. Problem 1150: the paper (p. 2) states that an ratio bounded away from over Littlewood polynomials would prove the Littlewood-polynomial form of Erdős's conjecture, which asks for with for every non-constant Littlewood polynomial , where for degree , while this problem asks for for all large ; its Theorem 1.1 gives Littlewood polynomials of unbounded degree with ratio tending to , still above , and the paper gives no maximum-modulus bound and does not decide the problem.
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.