Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Setting
Notation (1), p. 51. For a natural number , complex numbers and ,
The paper notes (p. 51) that consists of closed Jordan curves with pairwise disjoint interiors, which may meet only at zeros of , and its length is .
Statement
Theorem 1 (p. 52). For every such and ,
The paper places this against earlier upper bounds (p. 51): Dolzhenko's , Pommerenke's , Borwein's and Eremenko and Hayman's .
The conjectured extremal case (p. 52). The paper records as a natural conjecture, crediting it to its references [2]--[4] and [6], that among all the Bernoulli-type lemniscate , , is longest, and computes in polar coordinates
Proof pointer
P. 52: the inequality follows at once from Lemmas 1--3. By Lemma 1, , the secant variation times the analytic capacity. Lemma 2 (p. 55) gives : with the Ahlfors function of the unbounded complementary component, is bounded by there and equals at infinity. Lemma 3 (p. 55) gives for every : after a Möbius change of variable the image of the lemniscate is a level line of a rational function of degree at most , which meets each line through the origin in at most points. Multiplying the two bounds gives (3).
Dependencies
Lemma 1 (p. 53); Lemma 2 and Lemma 3 (p. 55); the definitions of and (pp. 52--53).
Source. V. I. Danchenko, The lengths of lemniscates. Variations of rational functions, Mat. Sb. 198 (2007), no. 8, 51--58 (in Russian); pages are the journal's, as on the source card.
Read depth. Claims checked: the statement, the setting (1) and the Bernoulli computation read on the print; the proofs of Lemmas 1--3 (pp. 53--55) read but not checked step by step. Nothing here is independently reviewed.
Bears on
- #114: at the theorem bounds the length of by for every monic of degree . The conjectured maximiser has length , so the bound exceeds it by a factor tending to as grows; the theorem does not decide whether maximises the length.