Strong binomiality conjecture for symmetric-power Chern coefficients

Less than 1 year old · traced to

Let An,d:={α∈Z≥0n:∣α∣=d}A_{n,d}:=\{\alpha\in\mathbb Z_{\ge0}^n:|\alpha|=d\} and yα:=α1x1+⋯+αnxny_\alpha:=\alpha_1x_1+\cdots+\alpha_nx_n. Define the Chern classes by

∏α∈An,d(1+yα)=∑k≥0ck(n,d).\prod_{\alpha\in A_{n,d}}(1+y_\alpha)=\sum_{k\ge0}c_k(n,d).

For each partition λ⊢k\lambda\vdash k, write

ck(n,d)=∑λ⊢kfλ(n,d)eλ.c_k(n,d)=\sum_{\lambda\vdash k}f_\lambda(n,d)e_\lambda.

Strong binomiality conjecture. For each fixed kk and each partition λ⊢k\lambda\vdash k, the coefficient fλ(n,d)f_\lambda(n,d) is a polynomial in finitely many binomial coefficients of the form

(d+n+an+b).\binom{d+n+a}{n+b}.

This refines separate polynomiality by predicting dependence through a distinguished family of binomial coefficients. The source gives no resolution status.

References

Primary source

Gergely Bérczi and László M. Fehér, “Positivity in classical enumerative geometry: a case study in synchronized AI-assisted mathematics”, arXiv:2605.25271 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.