Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (p. 22). Throughout Chapter 2, is entire and .
Problem 2.41 (p. 38, quoted). "Suppose that has finite order, and that is a rectifiable path on which . Let be the length of in . Find such a path for which grows as slowly as possible, and estimate in terms of . If has zero order, or more generally, finite order, can a path be found for which as ? If as , but under no weaker growth condition, it is shown by Hayman [394] and Piranian [635] that we may choose a ray through the origin for . If has a finite asymptotic value , the corresponding question may be asked for paths on which ."
The book's [394] is W. K. Hayman, Slowly growing integral and subharmonic functions, Comment. Math. Helv. 34 (1960), 75--84, and its [635] is G. Piranian, An entire function of restricted growth, Comment. Math. Helv. 33 (1959), 322--324. The book attributes the problem to P. Erdős, and Table 2 (p. 253) lists it among the problems of the 1974 symposium list.
Update 2.41 (p. 38). The update calls the problem a refined form of Problem 2.7 and says Gol'dberg and Eremenko (the book's [319]) solved it completely: for every function tending to infinity there is an entire with for every asymptotic curve. The update does not restate how bounds the growth of ; Update 2.7 (p. 25) gives it as arbitrarily slowly. For the finite-value question the update adds that for every some entire function of order has a finite asymptotic value with for every asymptotic curve on which ; Update 2.7 credits Gol'dberg and Eremenko with such examples of order arbitrarily close to .
Source. W. K. Hayman and E. F. Lingham, Research Problems in Function Theory, arXiv:1809.07200v2 (21 September 2018), Chapter 2, p. 38. The edition read is identified on the source card.
Read depth. Claims checked: the notation, the problem, its update and the cited reference entries were read clause by clause on the printed pages. The book proves nothing; it poses and reports.
Proof pointer
None; a problem. The Gol'dberg–Eremenko theorems are on the Gol'dberg–Eremenko card.
Dependencies
Problem 2.7, of which the update calls this problem a refined form.
Bears on
- Problem 1115: the problem's statement follows the first paragraph of Problem 2.41, from Hayman's 1974 list, without the zero-order clause and with for . Update 2.41 records the Gol'dberg–Eremenko negative answer to the linear-length question; it supplies no estimate of in terms of .