Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 39--41). A Fejér gap series is a sequence of positive integers with . An entire function has Fejér gaps if is a Fejér gap series; the constant term is not restricted (p. 39). For an entire the paper writes ,
for the characteristic function, with the number of roots of in counted with multiplicity, and defines the deficiency at by
(pp. 40--41). A finite deficient value is an with .
Theorem (p. 39). "An entire function with Fejér gaps has no finite deficient value."
That is, if has Fejér gaps then for every . The paper presents this as an improvement of the theorem of Fejér and Biernacki (its [4] and [1]) that an entire function with Fejér gaps takes every complex value infinitely often, and of Kövari's theorem (its [9]) that an entire function has no finite Borel exceptional value when satisfies for some positive increasing on with , both conditions as printed (p. 39). It notes (p. 40) that the bound of its [6, 11] already gives the theorem for functions of finite lower order, since Fejér gaps force , a remark it credits to Fuchs; the theorem is new information when the lower order is infinite.
The hypothesis cannot be weakened to Fabry gaps: Section 5 builds an entire function with Fabry gaps and .
Source. The Theorem of Section 1, p. 39, of Takafumi Murai, The deficiency of entire functions with Fejér gaps, Ann. Inst. Fourier (Grenoble) 33 (1983), no. 3, 39--58, doi:10.5802/aif.930, as identified on the source card.
Read depth. Claims checked: the definitions (pp. 39--41) and the statement were read clause by clause on the printed pages. The proof of Section 4 (pp. 48--52) was read for its mechanism and not checked step by step; nothing here is independently reviewed.
Proof pointer
Section 4 (pp. 48--52). By Lemma 9 the exponent set is enlarged to a Fejér gap series satisfying the regularity condition (9), and the paper notes it suffices to prove with (p. 48). Lemma 11 (p. 48) shows that, log-finely, the maximum of on every short arc of a slightly larger circle is at least ; the proof integrates against a convolution of triangular kernels whose Fourier transform vanishes at the exponents up to the cut-off. With the Proposition this gives the estimates (18), and Lemma 12 (p. 50) reduces the theorem to outside a set of finite logarithmic measure, where is with its zeros in an annulus replaced by their reflections through a circle, as in (19), and multiplied by the constant . That bound is proved in 4.2 (pp. 50--52) by integrating (Lemma 2) over the short arcs where .
Dependencies
The Proposition of Section 3; Lemmas 1, 2 and 5 (pp. 41--42), Lemma 9 (p. 45) and Lemmas 10--12 (pp. 47--50) of the paper; Lemmas 1 and 2 are cited to Hayman's Meromorphic functions.
Bears on
- Problem 517: settles the instances with . The theorem itself concerns deficiencies; the step to infinitely many -points is the standard one that a transcendental entire function taking a value only finitely often has deficiency there. The paper does not treat functions with and , which its introduction calls difficult (p. 40).