A solution to the Erd s Problem #1040

arXiv:2609.06050 · math.CA, cs.AI · Submitted 2026-09-05 · Read on arXiv

math.CA, cs.AI

Submitted: 2026-09-05

Updated: 2026-09-05

Comments: We prove the general capacity-one case, completing the affirmative answer to the question of arbitrarily small lemniscate area in Erdős Problem #1040

License: http://creativecommons.org/licenses/by/4.0/

The gist: For a compact set K C, let (K) be the infimum of the planar areas of the unit lemniscates of all monic polynomials with zeros in K, allowing arbitrary degree and repeated zeros.

Abstract

For a compact set K C, let (K) be the infimum of the planar areas of the unit lemniscates of all monic polynomials with zeros in K, allowing arbitrary degree and repeated zeros. We prove that (K)=0 whenever cap(K)=1, with no regularity assumption on K. The proof uses a centered harmonic polynomial that is positive on all but a set of arbitrarily small area in the polynomial hull of K. A Fourier average of exterior harmonic measures realizes this polynomial as the logarithmic potential of a signed measure having bounded density with respect to the equilibrium measure. A positive perturbation and an L 1 approximation by empirical measures then produce the required polynomials. This extends the smooth-boundary result of Krishnapur, Lundberg, and Ramachandran to arbitrary compact sets of capacity one. Together with the capacity-greater-than-one theorem of Ghosh and Ramachandran and an elementary argument for unbounded sets, it follows that (F)=0 for every closed infinite set F C of transfinite diameter at least one, answering the vanishing question in Erdős Problem 1040.

Related papers