Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 3, p. 5, of Manjunath Krishnapur, Erik Lundberg and Koushik Ramachandran, On the area of polynomial lemniscates, arXiv:2503.18270v1 (24 March 2025), as identified on the source card.

Statement

The notation κn(K,t)\kappa_n(K,t), T\mathbb T and D‾\overline{\mathbb D} is that of Theorem 1.

Theorem 3 (p. 5, quoted). "For t∈(0,1)t\in(0,1), there exist 0<c<C<∞0<c<C<\infty (depending only on tt) such that for all n≥1n\geq1,

cn4≤κn(D‾,t)≤κn(T,t)≤Cn.\frac{c}{n^4}\leq\kappa_n(\overline{\mathbb D},t)\leq\kappa_n(\mathbb T,t)\leq\frac{C}{n}.

On the other hand, κn(T,t)≥cn2log⁡n\kappa_n(\mathbb T,t)\geq\frac{c}{n^2\log n}."

The upper bound comes from zn−1z^n-1 (p. 10). Remark 5 (p. 5) adds that for t=1−εnt=1-\varepsilon_n with εn=exp⁡(−(log⁡n)M)\varepsilon_n=\exp(-(\log n)^M) the proofs give $\kappa_n(\overline{\mathbb D},t)\le\kappa_n(\mathbb T,t)\lesssim(\log n)^M/n$.

Proof pointer

Upper bound: Section 4 (p. 10), from p(z)=zn−1p(z)=z^n-1. Lower bounds: Section 6.3 (pp. 20--23). The bound c/n4c/n^4 for the closed disc follows an argument of Pommerenke with Bernstein's inequality (p. 20). The bound c/(n2log⁡n)c/(n^2\log n) for zeros on the circle counts sign changes of log⁡∣p∣\log\lvert p\rvert in small balls, with Wagner's lower estimate for the arc length of Λ(t)∩T\Lambda(t)\cap\mathbb T and covering arguments.

Read depth

Claims checked: the statement was read clause by clause on p. 5 of the print; the proof was not checked.

Bears on

  • Problem 116: background only. The problem concerns the level 11; Theorem 3 concerns fixed levels below 11, where the minimal area is at most C/nC/n.