Fel's conjecture on universal symmetric polynomials for numerical semigroups
Let be the numerical semigroup under consideration, with multiplicity , generators , gap power sums , and invariants . Write and , where
Let be the universal symmetric polynomials defined from these power sums. Fel's conjecture. For every ,
This conjecture gives a complete formula for the invariants in terms of the universal symmetric polynomials and the gap power sums; the displayed cases for provide the initial evidence, while the general identity is the conjectural part.
References
Primary source
Evan Chen, Chris Cummins, GSM, Dejan Grubisic, Leopold Haller, Letong Hong, Andranik Kurghinyan, Kenny Lau, Hugh Leather, Seewoo Lee, Aram Markosyan, Ken Ono, Manooshree Patel, Gaurang Pendharkar, Vedant Rathi, Alex Schneidman, Volker Seeker, Shubho Sengupta, Ishan Sinha, Jimmy Xin and Jujian Zhang, “Fel's Conjecture on Syzygies of Numerical Semigroups”, arXiv:2602.03716 (2026).
Additional references
2 papers in this index state this conjecture (2025–2026). The statement above is taken from the most recent of them; the others are arXiv:2507.12352.
Progress summary
A February 2026 preprint claims an AI system proved the conjecture completely, but no independent confirmation has appeared.
Fel’s conjecture asserts a universal identity for the invariants of every numerical semigroup and every . Earlier work established the formula in low-degree cases and recorded the general expression conditionally.
Known results
- Explicit identities were recorded through at least in earlier work, while the general formula was stated conditionally.
- The catalogued literature contains two papers stating the conjecture, but neither earlier source reports a general proof or disproof.
February 2026 claimed proof
The preprint Fel’s Conjecture on Syzygies of Numerical Semigroups states that the identity holds for every as Theorem 1.11, using exponential generating functions and coefficient extraction. It claims a Lean/Mathlib formalization produced automatically by AxiomProver; this is a claimed solution, not independently verified, and no correction, refutation, or referee confirmation was found.
Current status (as of September 2026): A general proof is claimed in the February 2026 preprint and attributed to AxiomProver, but its correctness and formal verification remain independently unconfirmed.
Sources
- ar5iv.labs.arxiv.org
- arxiv.org
- arxiv.org
- github.com
- ui.adsabs.harvard.edu
- papers.cool
- emergentmind.com
- ugr.es
- themoonlight.io
- quantamagazine.org
- arxiv.org
- ar5iv.labs.arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- quantamagazine.org
- quantamagazine.org
- quantamagazine.org
- quantamagazine.org
- quantamagazine.org
- x.com
- arxiv.org
- arxiv.org
- arxiv.org
- x.com
- x.com
- x.com
Solutions 0
No solutions have been posted yet.