Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. T. Feng, T. Trinh, G. Bingham et al., Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems, arXiv:2601.22401v3 (5 February 2026); Section 3.2, the problem and Remark 3.2 on p. 18, the solution on pp. 18--19 with its footnote on p. 19. The result is unnumbered. The artifact is identified on the source card.
Read depth. Claims checked: the assertion, both constructions and their estimates (pp. 18--19) were read in full on the print. Nothing here is independently reviewed. A preprint.
Statement
For a closed infinite , is the infimum of the area of over the polynomials with all (p. 18). The paper proves that is not determined by the transfinite diameter , with the sets
Both are countable compact sets, so ; , while , which is below for large enough (pp. 18--19).
Proof pointer
For , every such polynomial has modulus below on the disc , of area . For , the polynomial has roots in , and a change of variables bounds the area of its lemniscate by . That countable compact sets have transfinite diameter zero is used without proof in the model output; a human footnote (p. 19) says it essentially follows from Ransford's Corollary 3.2.5 and the equivalence of transfinite diameter and logarithmic capacity, and that it is easy to verify directly for the two sets.
Dependencies
Ransford, Potential Theory in the Complex Plane (1995), Corollary 3.2.5, for the capacity-zero claim (cited in the footnote, not held).
Bears on
- Problem 1040: answers its first question, whether is determined by the transfinite diameter, in the negative. The second question, whether whenever the transfinite diameter is at least , is not addressed: Remark 3.2 (p. 18) says the model's argument for it was an incorrect reduction to the literature and was omitted.