Separate polynomiality of symmetric-power Chern coefficients
Separate polynomiality of symmetric-power Chern coefficients
Let and . Define the Chern classes by
For each partition , write
Separate polynomiality conjecture. For each fixed and each partition , the coefficient is polynomial in for fixed , and polynomial in for fixed .
This conjecture asserts separate polynomial dependence on the rank and degree parameters, a stronger structural property than merely having a closed formula. The source gives no resolution status.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
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).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.