Wiki
Wiki

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

Updated


Statement

Setting (pp. 1--2). f∈C[z]f\in\mathbb{C}[z] is monic and non-constant, E={z∈C:∣f(z)∣<1}E=\{z\in\mathbb{C}:\lvert f(z)\rvert<1\} and K={z∈C:∣f(z)∣≤1}K=\{z\in\mathbb{C}:\lvert f(z)\rvert\le1\}. The connected components of EE are E1,…,EmE_1,\ldots,E_m, and Kj=Ej‾K_j=\overline{E_j}. The note calls every partition of {E1,…,Em}\{E_1,\ldots,E_m\} an admissible partition. For a block SS of one, KSK_S is the union of the KjK_j with Ej∈SE_j\in S; nSn_S is the number of roots of ff in the components belonging to SS, counted with multiplicity; cS=1nS∑α∈Sm(α)αc_S=\frac1{n_S}\sum_{\alpha\in S}m(\alpha)\alpha is the weighted root mean; and r(S)=sup⁡z∈KS∣z−cS∣r(S)=\sup_{z\in K_S}\lvert z-c_S\rvert.

Claim 3.1 (Mean-centered partition claim, p. 2). There is an admissible partition pp with ∑S∈pr(S)≤2\sum_{S\in p}r(S)\le2; consequently the closed disks D‾(cS,r(S))\overline D(c_S,r(S)), S∈pS\in p, cover KK and have total radius at most 22.

Remark 3.2 (p. 2) observes that the covering follows from the definition of r(S)r(S), so the content of the claim is the radius-sum bound.

Status in the note

The note does not prove Claim 3.1. Sections 4 to 9 (pp. 2--10) set up a minimal counterexample to it and record partial estimates, and Section 8.4 (p. 10) names the step that remains open; see Section 8.4. Proposition 6.1 (p. 4) uses Claim 3.1 for lower degrees as an induction hypothesis.

For context the note recalls (p. 1) that Pommerenke proved the constant 22 achievable when EE is connected, with KK inside the disk of radius 22 about the mean of all the roots; that is the case m=1m=1 of the claim, with the one-block partition.

Read depth

Claims checked: the definitions, Claim 3.1 and Remark 3.2 were read clause by clause on the page images of the print. There is no proof to check. Nothing here is independently reviewed.

Source. Boon Qing Hong, Strategy Proposal on Covering Lemniscates for Erdős Problem #509, unpublished note (2026), 11 pp.; the edition read is named on the source card. The note credits ChatGPT 5.5 Pro for most of its details (p. 1).

Bears on

  • Problem 509: Claim 3.1, if true for every monic non-constant ff, would answer the problem's question yes with disks of a special form, centered at weighted root means of blocks of components. The note states it without proof, so it settles no case of the problem.