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 of degree , the lemniscate is and is its length. The extremal candidate is , with (p. 1, display (1)).
Asymptotic estimate (Section 9, pp. 11--17; the final display on p. 17). For every monic polynomial of degree ,
with the implied constant independent of . The paper gives no theorem number. The abstract (p. 1) and the introduction (p. 2) announce the weaker form as for all monic .
The intermediate bound behind it (p. 16) holds for each of the section's range (p. 12; the display on pp. 16--17 says "for every "):
where is an absolute constant built from the Fourier coefficients of the function on the unit circle (pp. 14, 16). The choice gives the estimate (p. 17). The authors add (p. 17) that they expect the exponent can be substantially improved, while bringing it below "seems quite a challenging problem".
Proof pointer
Sections 8 and 9 (pp. 10--17). The length is written as an area integral over by Stokes' formula applied to an extension of the outward unit normal of (p. 4, (4)). With the extension , , of Section 8, Section 9 starts from with (pp. 11--12), the term coming from (p. 11). Points of where is small, or which lie within of a zero of , cost ((7)--(10), p. 12), and the same bound is used once more, which leaves an integral over the rest . There the plane is cut into squares of side , and the oscillation of the phase on each square is controlled by Lemma 2 (p. 14): if is a square of side and is a real harmonic function in the twice larger square with the same center with everywhere there, then ; a scaling argument gives the bound for squares of side (p. 15). Summing gives (18) (p. 16), and a capacity bound for the union of the squares (area at most , 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 was redone here (each of , and is of order , and ). 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 , used twice for the term . 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 for the lemniscate length of every monic polynomial of degree ; the conjectured maximum is , so the bound matches it to first order. It decides the question for no degree.