Wiki
Wiki

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

Updated


Statement

Problem 4.13 (p. 75, quoted). "It is known that there exists a polynomial P(z)P(z)

P(z)=∑k=1nεkzk,εk=∓1P(z)=\sum_{k=1}^{n}\varepsilon_kz^k,\qquad\varepsilon_k=\mp1

for which

max⁡∣z∣=1∣P(z)∣<C1n.(4.2)\max_{|z|=1}|P(z)|<C_1\sqrt{n}.\qquad(4.2)

(See Clunie [158]). Is it necessarily true that C1>1+AC_1>1+A if (4.2) holds, where AA is a positive absolute constant?"

The book's [158] is J. Clunie, On schlicht functions, Ann. of Math. (2) 69 (1959), 511--519. The problem carries no attribution line, and Table 2 (p. 253) lists it among the problems of the 1967 edition.

Update 4.13 (p. 75). No progress had been reported to the authors.

Source. W. K. Hayman and E. F. Lingham, Research Problems in Function Theory, arXiv:1809.07200v2 (21 September 2018), Chapter 4, p. 75. The edition read is identified on the source card.

Read depth. Claims checked: the problem, its update and the cited reference entry were read clause by clause on the printed page. The book proves nothing; it poses and reports.

Proof pointer

None; a problem.

Dependencies

None.

Bears on

  • Problem 230: Problem 4.13 asks for coefficients ±1\pm1 what #230 asks for complex coefficients of modulus one, both with the sum from k=1k=1: whether the maximum modulus on the circle is at least (1+c)n(1+c)\sqrt n for an absolute c>0c>0; #230 asks this for n≥2n\ge2, and the book states no range of nn. The ±1\pm1 polynomials lie in #230's class, so an affirmative answer to #230 would answer Problem 4.13 affirmatively for n≥2n\ge2; a negative answer to #230 does not settle Problem 4.13.