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). is monic and non-constant, and . The connected components of are , and . The note calls every partition of an admissible partition. For a block of one, is the union of the with ; is the number of roots of in the components belonging to , counted with multiplicity; is the weighted root mean; and .
Claim 3.1 (Mean-centered partition claim, p. 2). There is an admissible partition with ; consequently the closed disks , , cover and have total radius at most .
Remark 3.2 (p. 2) observes that the covering follows from the definition of , 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 achievable when is connected, with inside the disk of radius about the mean of all the roots; that is the case 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 , 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.