Wiki
Wiki

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

Updated


Statement

Setting (pp. 1, 3). For a monic polynomial pp of degree nn, the lemniscate is Lp={z∈C:∣p(z)∣=1}L_p=\{z\in\mathbb C:\lvert p(z)\rvert=1\} and ∣Lp∣\lvert L_p\rvert is its length. The extremal candidate is p0(z)=zn−1p_0(z)=z^n-1, with ∣Lp0∣=2n+O(1)\lvert L_{p_0}\rvert=2n+O(1) (p. 1, display (1)).

Asymptotic estimate (Section 9, pp. 11--17; the final display on p. 17). For every monic polynomial pp of degree nn,

∣Lp∣≤2n+O(n7/8),\lvert L_p\rvert\le 2n+O(n^{7/8}),

with the implied constant independent of pp. The paper gives no theorem number. The abstract (p. 1) and the introduction (p. 2) announce the weaker form ∣Lp∣≤2n+o(n)\lvert L_p\rvert\le 2n+o(n) as n→∞n\to\infty for all monic pp.

The intermediate bound behind it (p. 16) holds for each δ\delta of the section's range δ∈(0,14)\delta\in(0,\frac14) (p. 12; the display on pp. 16--17 says "for every δ>0\delta>0"):

∣L∣≤26πδn+2πn+e2δ(1π+2δ+4aδ3n)2π(n−1),\lvert L\rvert\le 26\pi\delta n+2\pi\sqrt n +e^{2\delta}\Bigl(\frac1\pi+2\delta+\frac{4a}{\delta^3\sqrt n}\Bigr)2\pi(n-1),

where a=∑k≠0∣ak∣/∣k∣a=\sum_{k\neq0}\lvert a_k\rvert/\lvert k\rvert is an absolute constant built from the Fourier coefficients aka_k of the function Re⁡+z\operatorname{Re}_+z on the unit circle (pp. 14, 16). The choice δ≈n−1/8\delta\approx n^{-1/8} gives the estimate (p. 17). The authors add (p. 17) that they expect the exponent 7/87/8 can be substantially improved, while bringing it below 1/21/2 "seems quite a challenging problem".

Proof pointer

Sections 8 and 9 (pp. 10--17). The length is written as an area integral over E={∣p∣<1}E=\{\lvert p\rvert<1\} by Stokes' formula applied to an extension of the outward unit normal of LL (p. 4, (4)). With the extension s=∣p′∣/φs=\lvert p'\rvert/\varphi, φ=p′/p\varphi=p'/p, of Section 8, Section 9 starts from ∣L∣≤πn+J\lvert L\rvert\le\pi\sqrt n+J with J=−Re⁡∬E∣φp∣φφ′φ dAJ=-\operatorname{Re}\iint_E\frac{\lvert\varphi p\rvert}{\varphi}\frac{\varphi'}{\varphi}\,dA (pp. 11--12), the term πn\pi\sqrt n coming from ∬E∣p′∣ dA≤πn\iint_E\lvert p'\rvert\,dA\le\pi\sqrt n (p. 11). Points of EE where ∣φ′/φ∣\lvert\varphi'/\varphi\rvert is small, or which lie within 2δ/n2\delta/\sqrt n of a zero of pp′pp', cost O(δn)O(\delta n) ((7)--(10), p. 12), and the same bound πn\pi\sqrt n is used once more, which leaves an integral JδJ_\delta over the rest EδE_\delta. There the plane is cut into squares of side δ2/n\delta^2/\sqrt n, and the oscillation of the phase on each square is controlled by Lemma 2 (p. 14): if QQ is a square of side 11 and uu is a real harmonic function in the twice larger square with the same center with ∣∂ˉu∣>R\lvert\bar\partial u\rvert>R everywhere there, then ∣∬Qeiu dA∣≤4/R\bigl\lvert\iint_Qe^{iu}\,dA\bigr\rvert\le4/R; a scaling argument gives the bound 4A(Q)/(Rℓ)4A(Q)/(R\ell) for squares of side ℓ\ell (p. 15). Summing gives (18) (p. 16), and a capacity bound for the union FF of the squares (area at most πe4δ\pi e^{4\delta}, p. 16) finishes the estimate.

Read depth

Claims checked: the statement and the intermediate bound on pp. 16--17 were read clause by clause on the page images of the arXiv version, and the exponent count for δ≈n−1/8\delta\approx n^{-1/8} was redone here (each of 26πδn26\pi\delta n, 4πδn4\pi\delta n and 8aπn/δ38a\pi\sqrt n/\delta^3 is of order n7/8n^{7/8}, and e2δ⋅2(n−1)=2n+O(n7/8)e^{2\delta}\cdot2(n-1)=2n+O(n^{7/8})). The proof was read for structure only. Nothing here is independently reviewed.

Dependencies

The bound of Section 8 supplies the extension of the normal and the bound ∬E∣p′∣ dA≤πn\iint_E\lvert p'\rvert\,dA\le\pi\sqrt n, used twice for the term 2πn2\pi\sqrt n. External input named by the paper: Pólya's area bound for sets of logarithmic capacity (Ransford, Theorem 5.3.5).

Source. A. Fryntov and F. Nazarov, New estimates for the length of the Erdős-Herzog-Piranian lemniscate, in Linear and Complex Analysis, Amer. Math. Soc. Transl. Ser. 2, 226 (2009), 49--60, doi:10.1090/trans2/226/05; the edition read, and its page numbering, are named on the source card.

Bears on

  • Problem 114: an upper bound 2n+O(n7/8)2n+O(n^{7/8}) for the lemniscate length of every monic polynomial of degree nn; the conjectured maximum ∣Lp0∣\lvert L_{p_0}\rvert is 2n+O(1)2n+O(1), so the bound matches it to first order. It decides the question for no degree.