Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Theorem 2 (p. 498): a path to infinity of length at most u(z)^{K+o(1)}
Source. Theorem 2, p. 498, with the definitions on pp. 497--498, Remarks 3 and 4 of section II on pp. 499--500 and the proof in section IV, pp. 501--504, of Jang-Mei Wu, Length of paths for subharmonic functions, J. London Math. Soc. (2) 32 (1985), 497--505, doi:10.1112/jlms/s2-32.3.497, the edition named on the source card.
Read depth. Claims checked: the statement, the definitions it uses and Remarks 3 and 4 were read clause by clause on the page images of the print; the proof was not checked. Nothing here is independently reviewed.
Statement
For subharmonic in let and let
be its lower order (p. 497). For a path starting at a point and a point on , is the part of from to , and denotes length (p. 498).
Let be subharmonic in of lower order with , and let and . Then there is a path from a finite point to on which
The path does not depend on (p. 501).
The paper says (p. 498) that the theorem improves Theorem B when has positive lower order. It also generalizes Theorem C (p. 498), which the paper attributes to Rossi and Weitsman: for nonconstant harmonic in there are paths and to on which (the growth that Barth, Brannan and Hayman obtained along a path), with for any and , a positive absolute constant. The paper says Theorem 2 generalizes Theorem C because every nonconstant harmonic function in has lower order at least , and that it shows the constant can be eliminated.
Sharpness and conjecture (pp. 499--500)
- Remark 3: the theorem is sharp for . A modification of an example of Barth, Brannan and Hayman gives a harmonic of lower order with $\int_\Gamma\lvert u\rvert^{-2}\lvert dz\rvert=\infty$ on every path to on which . For any and with , Eremenko constructed an entire of lower order and order with on every path to on which . From these the paper concludes that cannot be reduced when . For the paper has no example and thinks is not best possible.
- Remark 4: the paper conjectures that (1.7) holds with for and for , where is the order of .
Proof, as a pointer
Section IV, pp. 501--504. Only (1.5) needs proof; (1.6) and (1.7) follow from it (p. 501). The path is a union of curves from to , each a chain of paths given by Theorem 1 in nested components of sublevel sets of , with ; the cases and are estimated separately. The proof was not checked here.
Dependencies
Theorem 1 (p. 497), through its constant in (1.2).
Bears on
Problem 514: the paper does not mention Erdős or the problem. Its theorem is stated for subharmonic of positive lower order, with the maximum of on , and bounds the length of the path up to by a power of ; the paper draws no consequence for entire functions.