return

Celebratio Mathematica

Thomas Milton Liggett

Approximating multiples of strong Rayleigh random variables

by Thomas M. Liggett

Thomas Lig­gett’s last pa­per was un­pub­lished at the time of his death in 2020. The text that fol­lows is an ed­ited draft of that pa­per, pre­pared by Wen­pin Tang, who also provided the an­nota­tions throughout. Note: Strong Rayleigh ran­dom vari­ables are also called Pois­son bi­no­mi­al ran­dom vari­ables. Some res­ults in this pa­per are presen­ted in Sec­tion 4 of the sur­vey art­icle of W. Tang and F. Tang (“The Pois­son bi­no­mi­al dis­tri­bu­tion — old & new” (2019), arX­iv:1908.10024), which provides fur­ther ref­er­ences.

1. Introduction

Sup­pose that (1)f(u)=i=0nciui is a poly­no­mi­al with pos­it­ive coef­fi­cients ci>0.1 Then:

  1. f is said to be strong Rayleigh (SR) if all of its roots are real (and hence neg­at­ive). This is equi­val­ent to say­ing that f can be factored in­to poly­no­mi­als of de­gree 1 with pos­it­ive coef­fi­cients.
  2. f is said to be Hur­witz (H) if all of its roots have neg­at­ive real part. Since (uz)(uz¯)=u22uRe(z)+|z|2, this is equi­val­ent to say­ing that f can be factored in­to poly­no­mi­als of de­gree at most 2 with pos­it­ive coef­fi­cients.

In this pa­per we con­sider the fol­low­ing ques­tion: When can f be factored in­to poly­no­mi­als of de­gree at most j with pos­it­ive coef­fi­cients? We will call this prop­erty Pj.

One mo­tiv­a­tion for this is the fol­low­ing: Ex­cept for the nor­mal­iz­a­tion f(1)=1, the f in (1) is the prob­ab­il­ity gen­er­at­ing func­tion (pgf) EuX of a ran­dom vari­able X with dis­tri­bu­tion ci=P(X=i). If it2 has prop­erty Pj, then there are in­de­pend­ent ran­dom vari­ables Xi with val­ues in {0,1,,j} so that X and iXi have the same dis­tri­bu­tion. This prop­erty was ex­ploited in [◊] in the case j=1 in or­der to ob­tain vari­ous prob­ab­il­ist­ic lim­it the­or­ems.

An­oth­er mo­tiv­a­tion comes from [◊]. In our con­sid­er­a­tion of mul­tivari­ate cent­ral lim­it the­or­ems for SR vec­tors, we raised the fol­low­ing ques­tion: if X has an SR pgf and j,k1, how well can one ap­prox­im­ate jkX by an SR ran­dom vari­able? We were able to solve this prob­lem for j=1, show­ing that 1kX is SR. It turns out that 2kX is very far from be­ing SR, in the sense that the ima­gin­ary parts of some roots of the pgf are large. Nev­er­the­less, we will see that a com­bin­a­tion of the res­ults in [◊] with the Hermite–Biehler the­or­em (see [◊] for ex­ample) im­plies that 2kX is H. We then spec­u­late about pos­sible ex­ten­sions of this to j3. For the ap­plic­a­tions we have in mind, this prop­erty is gen­er­ally as use­ful as SR.

A suf­fi­cient con­di­tion for SR is that the coef­fi­cients of f sat­is­fy (2)ci2>4ci1ci+1,1in1; see [◊]. A suf­fi­cient con­di­tion for H if n>5 is that the coef­fi­cients of f sat­is­fy (3)cici+1(2.147)ci1ci+2,1in2; see [◊].

These suf­fi­cient con­di­tions are quite re­strict­ive. For ex­ample, if f(u)=(u+1)n, so that ci=(ni), then ci2ci1ci+1=i+1ini+1ni. There­fore limilimnci2ci1ci+1=1, so (2) fails for large n.

The Hermite–Biehler the­or­em gives an NASC3 for H:

The­or­em 1: (Hermite–Biehler)4 Giv­en a poly­no­mi­al f as in (1) with pos­it­ive coef­fi­cients, write f(u)=i=01uihi(u2). Then f has prop­erty P2 if and only if the roots of h0,h1 are neg­at­ive and in­ter­lace, with the largest of these be­ing a root of h0.

By ana­logy with this res­ult, we con­sider the fol­low­ing: Giv­en a poly­no­mi­al f as in (1) with pos­it­ive coef­fi­cients, write (4)f(u)=i=0j1uihi(uj). We will say that f has prop­erty Qj if the roots of h0,h1,,hj1 are neg­at­ive and in­ter­lace, with the largest be­ing a root of h0, the second largest be­ing a root of h1, etc.

Note that Q1=P1. The Hermite–Biehler the­or­em is the state­ment that Q2=P2. However, Q3P3 as the fol­low­ing ex­ample shows. Let f(u)=u5+u4+u3+2u2+32u+13. By defin­i­tion (4), we have h0(u)=u+13,h1(u)=u+32,h2(u)=u+2. The roots of f are z1, z¯1, z2, z¯2, w, where the (roun­ded) val­ues are z1=.725+.100i,z2=.435+1.137i,w=.420. Then (uw)(uz2)(uz¯2)=.623+1.116u.449u2+u3, so f is not P3. However, the roots of h0,h1,h2 are 13, 32, 2 re­spect­ively, which do in­ter­lace cor­rectly. We are not aware of a use­ful cri­terion for Pj for j3.

In the fol­low­ing sec­tion, we prove that 2kX is P25 if X is P1, and spec­u­late about the likely situ­ation for 3kX. In par­tic­u­lar, we con­jec­ture that 34X is P3. 35X is not P3, but we con­jec­ture that it is nearly so, in that the pgf can be factored in­to poly­no­mi­als of de­gree at most 3 with at most one of the factors hav­ing a neg­at­ive coef­fi­cient. We will call this situ­ation al­most P3. More gen­er­ally, it may be the case that 3kX is P3 if k1(mod3) and al­most P3 if k2(mod3).

2. Some examples

Sup­pose the roots of h0,h1,h2 are neg­at­ive and in­ter­lace. Let these roots be de­noted by tm<tm1<<t0<0. Then f(u)=h0(u3)+uh1(u3)+u2h2(u3), where h0 has roots t0,t3,, and h1 has roots t1,t4,, and h2 has roots t2,t5,. The de­gree of f is m+3.

We be­gin with the case m=1, so h0(y)=a(yt0),h1(y)=b(yt1),h2(y)=c, with a,b,c>0. Then (5)f(u)=at0bt1u+cu2+au3+bu4. If we write f(u)=(u+d)(c3u3+c2u2+c1u+c0) and solve, we get c3=b,c2=abd,c1=cad+bd2,c0=bt1dc+ad2bd3, where f(d)=0. Now we seek the con­di­tion un­der which fP3. For the coef­fi­cients to be non­neg­at­ive, we need b0,abd0,cad+bd20,bt1dc+ad2bd30. Writ­ing f(d)=d(bd3ad2+cd+bt1)at0=d2(bd2ad+c)(bdt1+at0), we see that these in­equal­it­ies are equi­val­ent to abd0,bt1d+at00.

A ne­ces­sary and suf­fi­cient con­di­tion for the ex­ist­ence of a d>0 so that6 f(d)=0,at0bt1dab, is that f take on op­pos­ite signs (in­clud­ing 0) at two points in the in­ter­val (at0bt1,ab). To find a use­ful suf­fi­cient con­di­tion, write b3f(γab)=a2bcγ2ab3(γt1+t0)γ3(1γ)a4. If γ=1, this is ab[acb2(t1+t0)]. This is 0 if and only if t1+t0ac/b2. It is 0 if γt1t0 and bcγ(1γ)a2. There­fore, a suf­fi­cient con­di­tion for the ex­ist­ence of the re­quired d is that there ex­ist a γ[0,1] so that (6)t0t1acb2,γt1t0,andbcγ(1γ)a2.

When is Q3 sat­is­fied? If n=3, P3 and Q3 are both auto­mat­ic. If n=4, Q3 is equi­val­ent to c1c3c0c4.7 If f is P3 but not P2, then f(u)=(a0+a1u)(b0+b1u+b2u2+b3u3),c1c3c0c4=a12b0b2+a0a1b1b2+a02b1b3, so f is Q3. However, P2 does not im­ply Q3. For ex­ample, f(u)=(1+u2)2 is P2 but not Q3, since c1c3c0c4=1. More gen­er­ally, if f(u)=(a0+a1u+a2u2)(b0+b1u+b2u2), then c1c3c0c4=(a0b1+a1b0)(a1b2+a2b1)a0a2b0b2. This is non­neg­at­ive if a0a24a12, b0b24b12.8

If n=5, Q3 is equi­val­ent to c1c3c0c4 and c2c4c1c5.9 If f(u)=(a0+a1u+a2u2)(252+12u2+u3), then c1c3c0c4=252(a12a0a2). In this case, f is P3 but not P2, but it may not be Q3.

3. The approximations

We be­gin by show­ing that in gen­er­al, X be­ing SR does not im­ply that 23X is SR, and in fact that this is very far from be­ing the case.

The­or­em 2: Sup­pose X is B(3n,12), and zi are the roots of the pgf of 23X. Then max[Im(zi)]212(9n29n1).

Proof.  Up to a con­stant mul­tiple, the pgf of 23X is f(u)=i=03n(3ni)u2i/3=i0(3n+13i+1)u2i+i0(3n3i+2)u2i+1, which has de­gree d=2n. Let z1,z2, be the com­plex roots with pos­it­ive ima­gin­ary part and w1,w2, be the real roots. Then f(u)=j(u22uRe(zj)+|zj|2)j(uwj). Both of these ex­pres­sions have ud coef­fi­cients equal to 1. Identi­fy­ing the coef­fi­cients of ud1 gives (7)2jRe(zj)jwj=3n. Identi­fy­ing the coef­fi­cients of ud2 gives 4i<jRe(zi)Re(zj)+j|zj|2+2jRe(zj)iwi+i<jwiwj=(3n+13n2). Com­bin­ing this with (7) leads to i[Im(zi)]2i[Re(zi)]212iwi2=12n(9n29n1). There­fore, since there are at most n pairs of com­plex con­jug­ate roots, nmax[Im(zi)]2i[Im(zi)]212n(9n29n1).

Here is the res­ult from [◊] that we used to show that 1kX is SR if X is SR. For a poly­no­mi­al f of de­gree n, write (8)f(x)=i=0k1xigi(xk), where gi is a poly­no­mi­al of de­gree nik.

The­or­em 3: ([◊],Theorem 4.3)  If f is SR with de­gree n, the cor­res­pond­ing poly­no­mi­als gi are SR as well. Fur­ther­more, their roots are in­ter­laced in the sense that if the col­lec­tion of all nk+1 roots sj of the gi’s are placed in in­creas­ing or­der, snk<<s4<s3<s2<s1<s0<0, then the roots of gi are si, si+k, si+2k,.

This state­ment is il­lus­trated in the fol­low­ing ar­ray, in the case k=3: (s6s5s4s3s2s1s00g00++00+g1++00++g2+00+++). Note that each row is peri­od­ic of peri­od 6, and each row is ob­tained from the pre­vi­ous row via a shift. The proof in [◊] is by in­duc­tion on the de­gree of f. The pgf of 1kX is igi, which al­tern­ates signs at the points smk. There­fore, it has a root in each of the in­ter­vals (s(m+1)k,smk), thus show­ing that 1kX is SR (=P1).

The­or­em 4: If X is P1, then 2kX is P2.

Proof.  It suf­fices to prove the res­ult for k odd. If k is odd, the pgf of 2kX is (9)i=0(k1)/2gi(u2)+ui=(k+1)/2k1gi(u2). By the Hermite–Biehler the­or­em, all roots of (9) have neg­at­ive real parts if and only if all the roots of i=0(k1)/2gi(u2)andi=(k+1)/2k1gi(u2) are neg­at­ive and in­ter­lace, with the largest of these be­ing a root of i=0(k1)/2gi(u2).

If k=3, one can see from the above ar­ray that g0()+g1() has a root in each of the intervals (s7,s6),(s4,s3),(s1,s0) and g2() has a root in each of the intervals (s9,s7),(s6,s4),(s3,s1), since the val­ues of the func­tion at the two en­d­points of each in­ter­val have op­pos­ite signs. There­fore, the neg­at­ive roots in­ter­lace. For lar­ger odd k, the ar­gu­ment is sim­il­ar. Now i=0(k1)/2gi() has a root in each of the intervals (s(k1)/2+2k,s2k),(s(k1)/2+k,sk),(s(k1)/2,s0) and i=(k+1)/2k1gi() has a root in each of the intervals (s3k1,s(k+1)/2+2k),(s2k1,s(k+1)/2+k),(sk1,s(k+1)/2). It fol­lows that 2kX is H (=P2).  ◻

The situ­ation for the case 3kX, where k is not a mul­tiple of 3, is sim­il­ar. Its pgf is h0(u)+uh1(u)+u2h2(u), where h0(u)=i=0k/3gi(u),h1(u)=k/32k/3gi(u),h2(u)=i=2k/3k1gi(u). Then h0 has a root in each of the intervals (sk/3+ik,sik) for i0,h1 has a root in each of the intervals (s2k/3+ik,sk/3+ik) for i0,h2 has a root in each of the intervals (sk1+ik,s2k/3+ik) for i0. In a few cases, the in­ter­val is of the form (a,a), which is in­ter­preted as the singleton {a}. So, the roots of h0,h1,h2 are neg­at­ive and in­ter­lace. Un­for­tu­nately, as was poin­ted out earli­er, this prop­erty does not im­ply P3.

The case of 3kX is more chal­len­ging, since for each root with pos­it­ive real part, one must find a neg­at­ive root that com­pensates for it. It is not simply a mat­ter of prov­ing some prop­erty for each root, as was the case for P1 and P2. All we can of­fer at this point is spec­u­la­tion based on com­pu­ta­tions of roots in spe­cial cases. If f is P3 but not P2, f will have com­plex roots of pos­it­ive real part. For a neg­at­ive real root w and a con­jug­ate pair of roots z,z¯ with pos­it­ive real part, let z,w=(uw)(uz)(uz¯). For this cu­bic poly­no­mi­al to have pos­it­ive coef­fi­cients, it is ne­ces­sary and suf­fi­cient that z+z¯wzz¯z+z¯.

Here is what seems to be the case. Let w1,w2, be the real roots of f ordered in in­creas­ing or­der of their ab­so­lute val­ues, and z1,z2, be the roots with pos­it­ive real and ima­gin­ary parts, ordered in in­creas­ing or­der of the real parts. As­sume that X is SR and takes val­ues 0,1,,n.

Let f be the pgf of 34X. The de­gree of f is d=34n. Then f ap­pears to be P3 in gen­er­al. The num­ber of zi’s and the num­ber of wi’s are close to n4. This has been checked in a num­ber of cases, in­clud­ing XB(n,p) for n=54 and 75, and p=1100, 12 and 100101.10 If XB(n,12), the pgf of 34X is P2 for n9. If 10n30, it is P3 and can be factored in­to n4 ir­re­du­cible cu­bics, with an ex­tra lin­ear factor if d1mod3 and an ex­tra ir­re­du­cible quad­rat­ic factor if d2mod3. Here ir­re­du­cible means that it can­not be fur­ther factored in­to poly­no­mi­als with pos­it­ive coef­fi­cients. The ap­pro­pri­ate pair­ing of real and com­plex roots is wi with zi. This pic­ture con­tin­ues to hold for many X’s that are sums of in­de­pend­ent Bernoulli ran­dom vari­ables with ran­domly chosen para­met­ers.

Here is some more de­tail when X is B(n,12) and f is the pgf of 34X, omit­ting mul­ti­plic­at­ive con­stants: n=2:f(u)=u+3 is P1,n=3:f(u)=u2+3u+4 is P2,n=4:f(u)=u3+4u2+6u+5=(u+a)(u2+bu+c) is P2,n=4:f(a)=0,b=4a,c=5a,f(0)=5,f(4)=19, so f(a)=0 for some 0<a<4. There­fore f is P2. It is not P1 since the dis­crim­in­ant of the quad­rat­ic factor is <0 for 0<a<4. The ac­tu­al val­ues are a=2.35, b=1.65, c=2.12. n=5:f(u)=u3+53u2+53u+1=(u+a)(u2+bu+c) is P2,n=5:f(a)=0,c=1a,b=53a,f(0)=1,f(53)=169, so f(a)=0 for some 0<a<53. Again, f is P2 but not P1. The ac­tu­al val­ues are a=1, b=23, c=1. n=6:f(u)=u4+21u3+20u2+15u+7=(u+a)(u+b)(u2+cu+d) is P2,n=6:f(a)=f(b)=0,d=7ab,c=21ab. Com­put­ing f(x+iy) with y0 and set­ting it =0 leads to f(x)12f(x)y2+y4=0,f(x)16y2f(x)=0. Solv­ing the second equa­tion for y2 and us­ing that in the first equa­tion leads to f(x)[f(x)]23f(x)f(x)f(x)+36[f(x)]2=0. Ex­pand­ing this yields a poly­no­mi­al in x, all of whose coef­fi­cients are neg­at­ive, so x<0. It fol­lows that f is P2. The ac­tu­al val­ues are a=20.04,b=.66,c=.30,d=.53.

The first case that is P3 is n=10. Now f(u)=11+45u+120u2+462u3+210u4+120u5+55u6+u7=(u+53)(u3+.24u2+.10u+.03)(u3+1.96u2+3.23u+7.69). Set­ting f(x+iy)=0 for y0 gives j=03(1)jf(2j)(x)y2j(2j)!=0,j=03(1)jf(2j+1)(x)y2j(2j+1)!=0.

Con­sider small n with X gen­er­al. Use ej for the ele­ment­ary sym­met­ric func­tions.

For n=3, f(u)=u2e0+ue1+(e2+e3) is P2.

For n=4, f(u)=u3e0+u2e1+ue2+(e3+e4) is P3, but may not be P2.

For n=5, f(u)=u3(e0+e1)+u2e2+ue3+(e4+e5) is P3, but may not be P2.

For n=6, f(u)=u4e0+u3(e1+e2)+u2e3+ue4+(e5+e6). Set­ting this equal to (u+w)(u3+au2+bu+c) with w0 gives f(w)=0 and w3a=w2e3we4+e5+e6=w3(e1+e2e0w),w2b=we4e5e6,wc=e5+e6. So that a,b,c0, we need e5+e6e4we1+e2e0. Com­pute e02f(e1+e2e0)=e1(e1e3e0e4)+e2(2e1e3e0e4)+e22e3+e02(e5+e6)0,16e03f(e1+e22e0)=e144e12(e12e0e3)8e02(e1e42e0e5),2e1e2(3e1e24e0e3)8e02(e2e42e0e6)4e22(e1e24e0e3)e240. Since e5+e6e4e1+e22e0, it fol­lows that f has a root w which makes a,b,c0. The in­equal­it­ies above fol­low from the New­ton in­equal­it­ies 16e1e025e2e134e3e243e4e352e5e461e6e5. It fol­lows that f is P3.

For n=7, f(u)=u5e0+u4e1+u3(e2+e3)+u2e4+ue5+(e6+e7). Set this equal to (u2+au+b)(u3+cu2+du+g). Solv­ing for the coef­fi­cients gives c=e1a,d=a2bae1+e2+e3,g=a3+2ab+a2e1be1a(e2+e3)+e4, with b2b[3a2+(e2+e3)2ae1)]+a4a3e1+a2(e2+e3)ae4+e5=0 and (e12a)b2+b[a3a2e1+a(e2+e3]e4]+(e6+e7)=0. Com­bin­ing these two equa­tions gives (and noth­ing is lost if e12a) b=2a53e1a4+[e12+2(e2+e3)]a3[e1(e2+e3)+2e4]a2+(e1e4+2e5)a[(e1e5(e6+e7)]5a36e1a2+[2e12+(e2+e3)]a[e1(e2+e3)e4]. Us­ing this value of b in either of those equa­tions im­plies that a must be a root of a de­gree-10 poly­no­mi­al H(a). Also, let­ting D=5a36e1a2+[2e12+(e2+e3)]a[e1(e2+e3)e4], we have Dd=3a58e1a4+[7e12+4(e2+e3)]a3[2e13+7e1(e2+e3)3e4]a2+[(e2+e3)(e2+e3+3e12)2(e1e4+e5)]a[e1(e2+e3)2e4(e2+e3)e1e5+(e6+e7)] and Dg=a6+3e1a5[3e12+2(e2+e3)]a4+[e13+4e1(e2+e3)]a3[(e2+e3)(e2+e3+2e12)+(e1e44e5)]a2+[e1(e2+e3)2+e12e44e1e5+2(e6+e7)]a[e1e4(e2+e3)e42e12e5+e1(e6+e7)]. Us­ing Poly­no­mi­alRe­duce, H(a)=[a4a3e1+a2(e2+e3)ae4+e5]Dg13(e6+e7)[13Dd+K(a)], where K(a)=29e1a42[20e12+17(e2+e3)]a3+[14e13+61(e2+e3)24e4]a2[27e12(e2+e3)+10(e2+e3)217e1e420e5]a+10[e1(e2+e3)2e4(e2+e3)e1e5+e6+e7]. Now the New­ton in­equal­it­ies are 17e1e026e2e135e3e244e4e353e5e462e6e571e7e6.

Un­for­tu­nately, the pgf of f 35X is not ne­ces­sar­ily P3. Take X to be B(n,12). For n16, f is P2, and for 17n20 is P3. For n=21, d=12, and there are 4 wi’s and 4 zj’s. For f to be P3, there would have to be a pair­ing of the wi’s and zj’s so that for each such pair, zi,wj has pos­it­ive coef­fi­cients. But, no such pair­ing ex­ists, since w1,zi has a neg­at­ive quad­rat­ic coef­fi­cient for i=1,2,3,4, so f is not P3. However, zi,wi and zi1,wi have pos­it­ive coef­fi­cients for i=2,3,4, so one can choose a fac­tor­iz­a­tion of f so that only one factor has a neg­at­ive coef­fi­cient. Note that it is not P4 either. It is P6, since (uw1)(uw2)(uz1)(uz¯1)(uz2)(uz¯2) has pos­it­ive coef­fi­cients. This may or may not be use­ful.

However, all is not lost, due to the fol­low­ing res­ult.

Pro­pos­i­tion 5: Sup­pose U and V are non­neg­at­ive in­teger-val­ued ran­dom vari­ables with P(U=m)=pm and P(V=m)=qm whose pgf’s sat­is­fy EuU=EuV(au3+bu2+cu+d). If b+c+d0, c+d0, d0, then U,V can be coupled so that UV+3 and then E(V+3U)=b+2c+3d.

Proof.  The dis­tri­bu­tions of U,V sat­is­fy pm=aqm3+bqm2+cqm1+dqm. Since a+b+c+d=1, sum­ming gives P(Um)=P(Vm3)+(b+c+d)qm2+(c+d)qm1+dqm. There­fore, if b+c+d0, c+d0, d0, U and V can be coupled so that UV+3 al­most surely.11 Com­put­ing the first mo­ment, we see that EU=mm[aqm3+bqm2+cqm1+dqm]=a(EV+3)+b(EV+2)+c(EV+1)+dEV=EV+(3a+2b+c), so us­ing again a+b+c+d=1, we con­clude that E(V+3U)=b+2c+3d.

For the above ex­ample, XB(21,12), we in­dic­ate the situ­ation be­low, with the (i,j) entry cor­res­pond­ing to zi,wj. If the entry is +, all coef­fi­cients of zi,wj are pos­it­ive. Oth­er­wise, the entry in­dic­ates which coef­fi­cient is neg­at­ive, and gives the value of b+2c+3d: (b;.036+c;.48c;.92b;.610++c;1.5b;1.80b;1.99++b;2.01b;2.20++). Writ­ing f=i=14zi,wi, we see that there is a coup­ling of 35X with V, a sum of three in­de­pend­ent ran­dom val­ues with val­ues 0,1,2,3, so that 35XV+3 and E(V+335X)=.035.

Let f be the pgf of 35X where X is a gen­er­al SR ran­dom vari­able tak­ing val­ues 0,1,,n. The de­gree of f is d=35n. Then the fol­low­ing ap­pears to be the case. There is a (not in gen­er­al unique) in­dex m so that zi,wi+1 has pos­it­ive coef­fi­cients if i<m and zi,wi has pos­it­ive coef­fi­cients if i>m. Then the pro­pos­i­tion can be ap­plied to the case zm,w1. In many cases, this par­ti­tion of the zi’s is not ne­ces­sary, and f is ac­tu­ally P3. This ap­pears to be the case, for ex­ample, if X is B(21,p) for p close to 0 or 1. In one of these cases, zi,wi+1 has pos­it­ive coef­fi­cients for all i, and in the oth­er zi,wi has pos­it­ive coef­fi­cients for all i.

For 21n26, one can choose all but one factor to have pos­it­ive coef­fi­cients, and the (nor­mal­ized) cu­bics cor­res­pond­ing to w1 are n=21:.015+.984u.002u2+.003u3,n=22:.013+.990u.011u2+.007u3,n=23:.012+.997u.024u2+.015u3,n=24:.011+1.003u.040u2+.026u3,n=25:.011+1.007u.059u2+.042u3,n=26:.010+1.008u.0819u2+.063u3.

Here is a lar­ger ex­ample, with X B(33,12), d=19. Now there are 7 wi’s and 6 zi’s: (+b+cbb++cccbbb++ccbbbb+ccbbbbb+c). Now, + means that all four coef­fi­cients are pos­it­ive, b or c means that the coef­fi­cient is neg­at­ive, but the hy­po­theses of the pro­pos­i­tion are sat­is­fied, and means that the hy­po­theses of the pro­pos­i­tion are not sat­is­fied at all. In the con­text of the last para­graph, the pos­sible val­ues of m are 2, 3, 4, 5.

From the ex­amples we have looked at, it ap­pears that the pgf of 3kX “usu­ally” sat­is­fies P3, and when it does not, it can be factored in­to cu­bics that have pos­it­ive coef­fi­cients ex­cept for one. That one can be treated us­ing the pro­pos­i­tion. Typ­ic­ally, the way this arises is that zi,wi has pos­it­ive coef­fi­cients for one range of i’s, and zi,wi+1 has pos­it­ive coef­fi­cients for a com­ple­ment­ary range of i’s. The ex­cep­tion­al factor ap­pears in a trans­ition from one range to the oth­er.

Write ziwj to mean that zi,wj has pos­it­ive coef­fi­cients. Take X to be B(n,12).

If n=33, d=19, and 35X sat­is­fies ziwi+1for 1i4,ziwifor 3i6. If n=51, d=30, and 35X sat­is­fies ziwi+1for 1i6,ziwifor 4i10. In neither case is P3 sat­is­fied.

If n=105, d=45, and 37X sat­is­fies ziwi+1for i=14,ziwifor 1i14,ziwi1for i=14,15, so P3 is sat­is­fied. We do not have a counter­example to P3 for 37X.

If n=105, d=39, and 38X sat­is­fies ziwi+1for 1i9,ziwifor 5i13,ziwi1for i=13, so P3 is not sat­is­fied.

4. The sufficient conditions

Mo­tiv­ated by the suf­fi­cient con­di­tions (2) and (3), we con­sider poly­no­mi­als f(u)=i=0nciui sat­is­fy­ing12 ci2=aci1ci+1,c0=cn. Then for n=2 f is {P1if a4,P2if a<4. If n=3, f(z)=c0(1+az+az2+z3)=c0(z+1)(z2+(a1)z+1), so f is {P1if a3,P2if 1a<3,P3if a<1. At the trans­ition cases, ex­cept for the factor of c0, f(z)={(z+1)3if a=3,(z+1)(z2+1)if a=1,(z3+1)if a=0.

If n=4, f(z)=c0(1+b3z+b4z2+b3z3+z4), where a=b2, so f is {P1if a>3.236,P2if 2<a<3.236,P4if a<2. If a=3.236, f(z) has double roots at 2.513 and .398. If a=2, f(z)=c0(1+z2)(1+23/4z+z2).

If n=5, f(z)=c0(1+a2z+a3z2+a3z3+a2z4+z5)=c0(z+1)[z4+(a21)z3+(a3a2+1)z2+(a21)z+1], so f is {P1if a>3.234,P2if 1.465<a<3.234,P3if 1a<1.465,P4if a<1.

If a=1, (z)=c0(1+z3)(1+z+z2).

If n=6, f(z)=c0(1+b5z+b8z2+b9z3+b8z4+b5z5+z6), where a=b2, so for vari­ous val­ues of a 0<P6<1.019<P4<1.091<P2<1.341<P1. This sug­gests the fol­low­ing gen­er­al con­jec­ture.

Con­jec­ture 6: If ci22ci1ci+1 (or ci1ci+1aci2ci+2 for some a), then f is P3.

Giv­en the poly­no­mi­al f(u)=i=0nciui and a b>0, define a poly­no­mi­al g(u)=i=0nciubi=j=0bndjuj,dj=i:jbi<j+1ci.

If f is the pgf of X, then g is the pgf of bX. Then dj2adj1dj+1=m[jbi<j+1bmj1<bibmjcicmiaj1bi<jbmj2<bibmj1cicmi]. We will say that the coef­fi­cients ci sat­is­fy the New­ton in­equal­it­ies if (10)ci2(ni)2ci1(ni1)ci+1(ni+1); see [◊], for ex­ample.

If b=1k, dj2adj1dj+1=i=0k1l=0k1[ckj+ickj+lackj+ikckj+l+k]. As poin­ted out earli­er, even if k=1 and ci=(ni), (2) fails for large n.

Acknowledgment

The ed­it­or thanks Subhro Ghosh for re­view­ing the pa­per, and for his vari­ous sug­ges­tions which im­proved the present­a­tion of the pa­per.