ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let βj∈R+\beta_j\in\mathbb{R}^+ and ζj∈C\zeta_j\in\mathbb{C}, and for suitable small zz define f(z)=∏j=1n(1−ζjz)βj=1+a1z+a2z2+…f(z)=\prod^n_{j=1}(1-\zeta_jz)^{\beta_j}=1+a_1z+a_2z^2+\ldots Suppose further that the aka_k are all real. Then there exists N=N(β1,β2,β3,…,βn)<∞N=N(\beta_1, \beta_2, \beta_3, \ldots, \beta_n)<\infty, independent of the ζj\zeta_j, such that min⁡(a1,a2,…,aN)≤0\min(a_1, a_2, \ldots, a_N)\leq0. Find a sharp, or good, upper bound for NN as a function of the β\beta's. This would be significant for Tur'an's power sum method. To see that N<∞N<\infty: if the βj\beta_j's are all integers, then ff is a polynomial and N=β1+β2+β3+…+βn+1N=\beta_1+\beta_2+\beta_3+\ldots+\beta_n+1. (The sort of estimate wanted in the general case.) If not, assume that ∣ζ1∣≤∣ζ2∣≤…≤∣ζn∣≤1|\zeta_1|\leq|\zeta_2|\leq\ldots\leq|\zeta_n|\leq1, and let m=max⁡{j:βj∈Z}m=\max\{j:\beta_j\in\mathbb{Z}\}. The radius of convergence of ([source label: 7.341]) is ∣ζm∣−1|\zeta_m|^{-1} and if the aka_k were all positive (or even greater than or equal to 00). then by Pringshein's theorem (see Titchmarsh ), ∣ζm∣−1|\zeta_m|^{-1} would be a singularity of ff. Since ff only has the singularities {ζj−1:βj∉Z}\{\zeta^{-1}_j:\beta_j\notin\mathbb{Z}\} we deduce that ζm>0\zeta_m>0. We multiply through by (1−ζm)−βm(1-\zeta_m)^{-\beta_m} which has positive coefficients, and repeat the arguments. After at most nn steps, we obtain a contradiction. This gives a finite NN for any particular set of ζj\zeta_j and the uniformity is straightforward. (R. Hall)

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.