Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Notation (pp. 125--126): ff is a monic polynomial (1) with zeros xνx_\nu, EE the set where ∣f∣<1|f|<1, LL the real axis, I=[−1,1]I=[-1,1] and Ir=[−r,r]I_r=[-r,r]; ∣E∩L∣|E\cap L| is linear measure.

Problem 1 (p. 131). "To determine the supremum and the infimum of the quantity ∣E∩L∣|E\cap L|, under the hypothesis that the xνx_\nu lie on the interval IrI_r (if no restriction is placed on the xνx_\nu, then the supremum is 4; see [6, p. 229]). The following theorem suggests the conjecture that if all the xνx_\nu lie on II, then ∣E∩L∣≤22|E\cap L|\leq2\sqrt2."

The "following theorem" is Theorem 3, the case of zeros at ±1\pm1. After its proof the paper adds (p. 132) that for zeros on II the infimum of ∣E∩L∣|E\cap L| is less than 22, by the example (x+1)(x−1)m(x+1)(x-1)^m with m≥3m\ge3, and that "Careful computations show that the infimum can not be approached by polynomials of the form (x−1)k(x+1)m(x-1)^k(x+1)^m." For zeros on IrI_r it notes (p. 132) that the infimum is 00 when r≥2r\ge2, that the minimum for fixed nn is O((2/r)n)O((2/r)^n) when r>2r>2, and for r=2r=2 it conjectures ∣E∩L∣>n−c|E\cap L|>n^{-c} (no quantifier on cc is printed).

Source. P. Erdős, F. Herzog, G. Piranian, Metric properties of polynomials, J. Analyse Math. 6 (1958), 125--148, doi:10.1007/BF02790232; Problem 1 on p. 131, the remarks on p. 132. The copy read is identified on the source card.

Read depth. Claims checked: the problem and the remarks were read clause by clause on the page images of pp. 131--132 on 2026-10-08. Nothing here is independently reviewed.

Dependencies

Theorem 3 (the evidence for the conjecture). Bounds drawn here from the paper's theorems are on the pages of Theorem 1 (infimum at least 2\sqrt2) and Theorem 2 (supremum at most 33).

Bears on

  • #1038: the problem's question is Problem 1 in the case r=1r=1, the supremum and infimum of ∣E∩L∣|E\cap L| over monic polynomials with all zeros in [−1,1][-1,1]; the paper conjectures 222\sqrt2 for the supremum and states that the infimum is below 22.