Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 6--8). For a block of the minimal partition , with and as on Proposition 6.1, the note puts by Lemma 7.1, so and is equivalent to . For and ,
and the layer-cake formula gives (Section 7.3, pp. 7--8).
Reduction (p. 8). If has at least two blocks, every block is proper and Proposition 6.1 gives , so in this multi-block case is equivalent to . The note says the truncation to is not justified when is a single block, where Proposition 6.1 does not apply.
The remaining target (Section 8.4, p. 10). In the multi-block case the note lists what it has for -dangerous blocks (blocks with and ): ; distinct such centers are more than apart (Section 8.1); each has a root outside it within distance of (Section 8.2); and, as expectations rather than results, that near should force near-segmental shape through the Barnard--Pearce--Solynin refinement of Faber's inequality unless the mean center is highly eccentric (Section 8.3, for connected ), and that split irreducibility should rule out highly eccentric mean centers. It states the remaining task as proving
from this rigidity together with Pólya--Faber projection control. Section 9 (p. 10) recalls Pólya's projection theorem and says the projected optimal centers need not equal the projected root means, which is where it stops.
The note proves none of the target. Being conditional on Proposition 6.1, the reduction itself assumes Claim 3.1 in lower degrees.
Read depth
Claims checked: Sections 7.3 and 8.1 to 8.4 and Section 9 were read clause by clause on the page images of the print. 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.
Bears on
- Problem 509: the note's own statement of the step its route to Claim 3.1 lacks; it is an open target, not a result, and settles no case of the problem.