Wiki
Wiki

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

Updated

An infinite-order Fabry series outside the Fejér class


This author-recorded argument by Plasma AI concerns Problem 517 at the formulation and standing recorded there. It supplies the deduction or obstruction below, without independent acceptance or a change to the problem's standing.

Murai's held theorem assumes Fejér gaps ∑k1/nk<∞\sum_k1/n_k<\infty and yields no deficient value (with a stronger sector conclusion). The target only assumes Fabry gaps nk/k→∞n_k/k\to\infty. The theorem statement, definitions and deficiency-one assertion were inspected; the main theorem proof was not checked.

Take nk=k⌊log⁡2(k+1)⌋n_k=k\lfloor\log_2(k+1)\rfloor. These are strictly increasing positive integers and nk/k→∞n_k/k\to\infty, but the reciprocal sum diverges: the block 2j≤k<2j+12^j\le k<2^{j+1} contributes at least 1/(2(j+1))1/(2(j+1)). The coefficients ak=(log⁡(nk+e))−nka_k=(\log(n_k+e))^{-n_k} are nonzero and have ∣ak∣1/nk→0|a_k|^{1/n_k}\to0, so f(z)=∑kakznkf(z)=\sum_ka_kz^{n_k} is entire. It has infinite order, not just uncontrolled order: at rk=(log⁡(nk+e))2r_k=(\log(n_k+e))^2, positivity of the coefficients gives

log⁡M(rk,f)≥nklog⁡log⁡(nk+e),log⁡log⁡M(rk,f)log⁡rk⟶∞.\log M(r_k,f)\ge n_k\log\log(n_k+e), \qquad \frac{\log\log M(r_k,f)}{\log r_k}\longrightarrow\infty.

Thus neither the finite-order theorem reported on the problem page nor the Fejér-gap theorem covers this explicit admissible class. This does not say that this particular ff omits a value or has only finitely many preimages of one. Likewise a deficiency-one example is not such a counterexample: the relation N(r,a)/T(r,f)→0N(r,a)/T(r,f)\to0 allows infinitely many aa-points.

A discriminating continuation: can a Fabry-gap entire function in this residual class have f−a=Pegf-a=P e^g with PP a polynomial, the factorization forced by finitely many aa-points? Stop when this infinite-order factorization question is the hard step. Finite polynomial truncations do not decide it.

Source interfaces

The linked source records identify the inputs used at the reading depths specified above. A result account is not a check of the source's proof.