Abstract:Inspired by long-standing open problems in algebraic combinatorics, we show that modern machine learning can meaningfully contribute to verifiable mathematical discoveries. In particular, we focus on the construction of simple mathematical functions under exact distributional constraints, a setting we formalize as Simple Learning Under Rigid Proportions (SLURP). We tackle this problem by introducing two methods: MapSeek-Functional, which models the desired function alternating pseudo-labeling and supervised training steps; and MapSeek-Symbolic, designed to directly produce symbolic formulas. We successfully apply both methods to a research problem in algebraic combinatorics, discovering a new combinatorial interpretation of the $q,t$-Narayana polynomials arising from representation theory. To our knowledge, this is the first such interpretation based on noncrossing partitions. Using one discovered statistic, we find a combinatorial proof of the symmetry of these polynomials in a previously unsolved case. To streamline verification and reproducibility, we release all code, including a formalization of all the mathematical discoveries of this paper in Lean 4.
| Comments: | 20 pages |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.19063 [cs.LG] |
| (or arXiv:2605.19063v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.19063 arXiv-issued DOI via DataCite (pending registration) |
From: Eugenio Cainelli [view email]
[v1]
Mon, 18 May 2026 19:36:08 UTC (166 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。