Higher-degree ULC failure conjecture for the polynomials fmf_m and hmh_m

From papers

For each integer m4m\geq 4, let fmf_m and hmh_m be the polynomials defined in the paper, and let the ULC inequality refer to the ultra-log-concavity inequality for their coefficients. Higher-degree ULC failure conjecture. Both fmf_m and hmh_m are not ultra-log-concave, and every coefficient of degree jj with

4jm24\leq j\leq m-2

fails the ULC inequality. This conjecture is based on computer computations for m=1m=1 through m=100m=100; the stated higher-degree failure pattern is not proved in the supplied passage.

Progress summary

Open

The conjecture has computational support and some related cases are proved, but its full higher-degree failure pattern remains unproved.

Stephanie Chen formulated the conjecture in 2025: for each m4m\ge 4, both fmf_m and hmh_m should fail ultra-log-concavity, with every coefficient degree jj satisfying 4jm24\le j\le m-2 violating the ULC inequality. The pattern was suggested by computations through m=100m=100, not proved in the paper.

Known results

  • Chen (2025) proves various lower-degree ULC failures and, in the relevant parity cases, proves that fmf_m and hmh_m are not ultra-log-concave overall.

Current status (as of August 2026): The higher-degree assertion for 4jm24\le j\le m-2 remains open; only the recorded lower-degree and relevant-parity overall failures are settled.

Sources
Sources & referencesView supporting material

Primary source

Stephanie Chen, “Log-Concavity of the Grothendieck Classes of Banana Graphs and Clasped Necklaces”, arXiv:2503.16296 (2025).

Solutions 1

Proof

Complete proof of the higher-degree ultra-log-concavity failure conjecture.

Consider Conjecture 3.9 of Stephanie Chen's arXiv:2503.16296v2. The associated paper appeared in Journal of Geometry and Physics 218 (2025), article 105666, doi:10.1016/j.geomphys.2025.105666; conjecture numbering here refers specifically to the accessible arXiv version. The paper already proves that the relevant polynomials are not ultra-log-concave overall. We prove its additional open assertion that every prescribed higher-degree inequality fails strictly.

Let

fm(x)=(1+x)m(1)mx+2,hm(x)=fm(x)+(1)m,f_m(x)=\frac{(1+x)^m-(-1)^m}{x+2}, \qquad h_m(x)=f_m(x)+(-1)^m,

and write aj=[xj]fm(x)a_j=[x^j]f_m(x). Both have degree d=m1d=m-1. We show that for every 4jm24\le j\le m-2,

(aj(m1j))2<aj1(m1j1)aj+1(m1j+1).(1)\boxed{ \left(\frac{a_j}{\binom{m-1}{j}}\right)^2 < \frac{a_{j-1}}{\binom{m-1}{j-1}} \frac{a_{j+1}}{\binom{m-1}{j+1}}. } \tag{1}

Since hmfmh_m-f_m is constant, the same strict inequality holds for hmh_m.

Pairing adjacent powers in the geometric quotient gives, for j1j\ge1,

aj=r0(m2r2j1).a_j=\sum_{r\ge0}\binom{m-2r-2}{j-1}.

Set

bj=aj(m1j),t=mj.b_j=\frac{a_j}{\binom{m-1}{j}},\qquad t=m-j.

These are probabilities that the maximum of a uniformly chosen jj-subset of {1,,m1}\{1,\ldots,m-1\} has the same parity as m1m-1; hence 0<bj10<b_j\le1. Comparing coefficients in

(x+2)fm(x)=(1+x)m(1)m(x+2)f_m(x)=(1+x)^m-(-1)^m

gives

2(mj)bj+jbj1=m.2(m-j)b_j+j b_{j-1}=m.

Eliminating the neighboring coefficients yields

bj1bj+1bj2=j+t2j(t1)Fj,t(bj),b_{j-1}b_{j+1}-b_j^2 =\frac{j+t}{2j(t-1)}F_{j,t}(b_j),

where

Fj,t(z)=2z2(j+2t+1)z+j+t.F_{j,t}(z)=2z^2-(j+2t+1)z+j+t.

Thus it suffices to prove Fj,t(bj)>0F_{j,t}(b_j)>0 for all j4, t2j\ge4,\ t\ge2.

Fix jj, and denote the normalized coefficient at m=j+tm=j+t by bj,tb_{j,t}. Its binomial formula gives the parity-step recurrence

bj,t+2=Tj,t(bj,t),Tj,t(z)=t(t+1)z+j(j+t)(j+t)(j+t+1).b_{j,t+2}=T_{j,t}(b_{j,t}), \qquad T_{j,t}(z)= \frac{t(t+1)z+j(j+t)}{(j+t)(j+t+1)}.

Let rj,tr_{j,t} be the smaller root of Fj,tF_{j,t}. Since

Fj,t(0)=j+t>0,Fj,t(1)=1t,F_{j,t}(0)=j+t>0,\qquad F_{j,t}(1)=1-t,

we have rj,1=1r_{j,1}=1 and 0<rj,t<10<r_{j,t}<1 when t>1t>1.

We establish the strict barrier transport

Tj,t(rj,t)<rj,t+2(j4, t1).(2)T_{j,t}(r_{j,t})<r_{j,t+2} \qquad(j\ge4,\ t\ge1). \tag{2}

Define

L=j3+4j2t+2j2+4jt2+8jt+5j+4t2+4t,J=j2t+2jt2+3jt+2j+2t2+2t,θ=(j+t)JtL.\begin{aligned} L&=j^3+4j^2t+2j^2+4jt^2+8jt+5j+4t^2+4t,\\ J&=j^2t+2jt^2+3jt+2j+2t^2+2t,\\ \theta&=\frac{(j+t)J}{tL}. \end{aligned}

Direct polynomial identities give

(j+t)2(j+t+1)2Fj,t+2(Tj,t(z))=t2(t+1)2Fj,t(z)+(t+1)((j+t)JtLz),\begin{aligned} &(j+t)^2(j+t+1)^2F_{j,t+2}(T_{j,t}(z))\\ &\qquad=t^2(t+1)^2F_{j,t}(z) +(t+1)\bigl((j+t)J-tLz\bigr), \end{aligned}

and

Fj,t(θ)=2j(j+t)2t2L2Kj,t,F_{j,t}(\theta) =-\frac{2j(j+t)^2}{t^2L^2}K_{j,t},

where, writing u=j40u=j-4\ge0,

Kj,t=u3t+u2(t2+11t)+u(6t2+35t4)+(5t2+25t16)>0K_{j,t} =u^3t+u^2(t^2+11t) +u(6t^2+35t-4)+(5t^2+25t-16)>0

for every t1t\ge1. Therefore Fj,t(θ)<0F_{j,t}(\theta)<0, so rj,t<θr_{j,t}<\theta. Substitution of z=rj,tz=r_{j,t} into the first identity yields

Fj,t+2 ⁣(Tj,t(rj,t))>0.F_{j,t+2}\!\left(T_{j,t}(r_{j,t})\right)>0.

Since Tj,tT_{j,t} is increasing and 0<Tj,t(rj,t)<10<T_{j,t}(r_{j,t})<1, while Fj,t+2(1)<0F_{j,t+2}(1)<0, this proves (2).

For odd tt, start from

bj,1=1=rj,1;b_{j,1}=1=r_{j,1};

the strict transport (2) proves bj,t<rj,tb_{j,t}<r_{j,t} for every odd t3t\ge3. For even tt, start from

bj,2=jj+1,Fj,2 ⁣(jj+1)=2(j+1)2>0;b_{j,2}=\frac{j}{j+1}, \qquad F_{j,2}\!\left(\frac{j}{j+1}\right) =\frac{2}{(j+1)^2}>0;

again (2) propagates bj,t<rj,tb_{j,t}<r_{j,t} to every even t2t\ge2. Hence

Fj,t(bj,t)>0for every j4, t2.F_{j,t}(b_{j,t})>0 \qquad\text{for every }j\ge4,\ t\ge2.

The determinant identity proves (1) at every 4jm24\le j\le m-2 for both fmf_m and hmh_m, exactly as conjectured.

The source's earlier global non-ultra-log-concavity result is prior; the new conclusion is strict failure at every individual degree in the full conjectured range.

0 endorsements
Shivam Patel ·