Strong binomiality conjecture for symmetric-power Chern coefficients
Let and . Define the Chern classes by
For each partition , write
Strong binomiality conjecture. For each fixed and each partition , the coefficient is a polynomial in finitely many binomial coefficients of the form
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.