Positivity in classical enumerative geometry: a case study in synchronized AI-assisted mathematics

📅 2026-05-24
📈 Citations: 0
Influential: 0
📄 PDF

career value

164K/year
🤖 AI Summary
This study addresses the long-standing lack of explicit formulas and structural understanding of Chern classes expressed as symmetric polynomials across various bases of symmetric functions. By integrating multiple artificial intelligence systems with human mathematical insight, we establish a collaborative workflow that closes the research loop from experimental exploration and conjecture generation to symbolic proof. We demonstrate for the first time the feasibility of AI-augmented pure mathematical discovery, providing explicit expressions for the Chern and K-theoretic classes of $\mathrm{Sym}^d(\mathbb{C}^n)$. Furthermore, we prove refined positivity and a novel form of log-concavity for their Schur coefficients when expanded in the binomial basis, uncovering deep combinatorial structures in the rank-two case.
📝 Abstract
We study the symmetric polynomial $\prod_{α\in A_{n,d}}\bigl(1+α_1 x_1+\cdots+α_n x_n\bigr)$ where $A_{n,d}:=\{α\in\mathbb{Z}_{\ge 0}^n:|α|=d\}$, which is the total Chern class of $\mathrm{Sym}^d(\mathbb{C}^n)$, viewed as a torus representation whose Chern roots are the weights $α_1 x_1+\cdots+α_n x_n$ for $α\in A_{n,d}$. Its homogeneous degree-$k$ part $c_k(n,d)$ is the $k$-th Chern class of $\mathrm{Sym}^d(\mathbb{C}^n)$. These Chern classes, together with their coefficients in various symmetric function bases, play a central role in enumerative geometry. Despite their simple definition, general closed formulas for their coefficients are subtle, and many structural properties of these classes have remained poorly understood. In this paper we prove several conjectures concerning their structure, establish explicit formulas, and study log-concavity properties for both the Chern classes and their $K$-theoretic analogue. In rank two, passing to the Schur basis and expanding the Schur coefficients in the binomial basis of $d$, we uncover a new binomial log-concavity phenomenon and prove refined positivity results. The paper demonstrates a novel methodology: we combine several AI systems with human mathematical insight in a coordinated workflow, deploying each tool according to its strengths in experimental discovery, conjecture formation, symbolic proof construction, and verification. To our knowledge, this is one of the first detailed case studies of orchestrating multiple AI tools to make substantial progress on a coherent mathematical research project.
Problem

Research questions and friction points this paper is trying to address.

Chern classes
symmetric polynomials
positivity
log-concavity
enumerative geometry
Innovation

Methods, ideas, or system contributions that make the work stand out.

AI-assisted mathematics
Chern classes
log-concavity
symmetric polynomials
Schur basis