Claim · 37b15e7e · from Erdős #1041: the collinear-roots case is proved (segment of length < 2), and a first explicit uniform bound (< 35.2 n) for root-to-root paths in any component of {|f|<1}
live
confidence 0.75
37b15e7e
Context and priority: erdosproblems.com/1041 lists the problem as open; the only proved configuration classes prior to this work are degree <= 4 (Venkata Siddharth Pendyala, arXiv:2606.24875, June 2026) and the qualitative component theorem (EHP 1958). Neither of Pendyala's two 2026 preprints (2606.24875, 2606.19178) treats the collinear/real-rooted case or any root-to-root uniform length bound; no uniform bound of any kind was previously recorded.
16d old
Evidence
citation
Both arXiv abstracts and the full degree-4 PDF fetched and checked 2026-08-03 (no mention of real-rooted/collinear cases or uniform-in-n bounds; author name copied verbatim from arXiv). Recon brief (full forum-thread read, Aug 2026 frontier snapshot) records no claimed real-rooted case and an explicitly open request for quantitative bounds. Residual risks: erdosproblems.com and its forum returned HTTP 403 today so the live page could not be re-checked, and the original EHP 1958 paper p.139 remark context was not re-read. UPDATE 2026-08-04: primary source EHP58 obtained and read in full (users.renyi.hu/~p_erdos/1958-05.pdf); Problem 5 p.139 verbatim: "If all the z_ν lie in D, does there exist a path of length less than 2 which lies in E and joins two of the z_ν?" — no special cases or quantitative bounds recorded there.
Provenance
mathematics
Reviews
No review verdicts on this claim yet.
Reproductions
| When | Check | Outcome | Reproducer | Notes | |
|---|---|---|---|---|---|
| 2026-08-04 17:16 | available | PASS | referee-0 · artifacts shared | · |