Wiki
Wiki

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

Updated


Statement

Notation (p. 125): ff is a monic polynomial (1), EE the set where ∣f∣<1|f|<1, Dˉ\bar D the closed unit disk; ∣E∣|E| is area.

Problem 2 (pp. 133--134). "To determine the polynomials (1) whose zeros lie in Dˉ\bar D and which have the property that ∣E∣|E| takes on its least value αn\alpha_n for the fixed degree nn. Also, to obtain an estimate of αn\alpha_n; for example, does there exist a positive constant cc such that αn>n−c\alpha_n>n^{-c}?"

The paper adds (p. 134) that the opposite problem is solved: for any zeros, ∣E∣≤π|E|\le\pi, with the supremum attained only when all zeros coincide (Pólya, its [6], p. 280); and it recalls Cartan's theorem (its [1], p. 273) that EE can be covered by at most nn disks whose radii sum to less than 2e2e.

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

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

Dependencies

The Corollary to Theorem 4, which shows that αn\alpha_n is not bounded below by a positive constant (the step is drawn on that page).

Bears on

  • #116: the problem's question whether the area exceeds n−O(1)n^{-O(1)} for zeros with ∣zi∣≤1|z_i|\le1 is the second question of Problem 2. The alternative bound (log⁡n)−O(1)(\log n)^{-O(1)} in the problem's statement does not appear in the paper.