Higher-degree ULC failure conjecture for the polynomials and
Higher-degree ULC failure conjecture for the polynomials and
For each integer , let and 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 and are not ultra-log-concave, and every coefficient of degree with
fails the ULC inequality. This conjecture is based on computer computations for through ; the stated higher-degree failure pattern is not proved in the supplied passage.
Progress summary
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 , both and should fail ultra-log-concavity, with every coefficient degree satisfying violating the ULC inequality. The pattern was suggested by computations through , not proved in the paper.
Known results
- Chen (2025) proves various lower-degree ULC failures and, in the relevant parity cases, proves that and are not ultra-log-concave overall.
Current status (as of August 2026): The higher-degree assertion for 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
Sign in to submit a solution.
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
and write . Both have degree . We show that for every ,
Since is constant, the same strict inequality holds for .
Pairing adjacent powers in the geometric quotient gives, for ,
Set
These are probabilities that the maximum of a uniformly chosen -subset of has the same parity as ; hence . Comparing coefficients in
gives
Eliminating the neighboring coefficients yields
where
Thus it suffices to prove for all .
Fix , and denote the normalized coefficient at by . Its binomial formula gives the parity-step recurrence
Let be the smaller root of . Since
we have and when .
We establish the strict barrier transport
Define
Direct polynomial identities give
and
where, writing ,
for every . Therefore , so . Substitution of into the first identity yields
Since is increasing and , while , this proves (2).
For odd , start from
the strict transport (2) proves for every odd . For even , start from
again (2) propagates to every even . Hence
The determinant identity proves (1) at every for both and , 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.