Searcharxiv⌕ Search

arXiv subjects

Eugenio Cainelli

Publications and source records attributed to Eugenio Cainelli.

3 recordsLinked to original sources

AI Discovery in Combinatorics: From Problems to Solutions and Back to Bigger Problems

We introduce $qt$Bench, a benchmark of 29 open problems in algebraic combinatorics. These problems ask for a simple combinatorial algorithm that explains given polynomial coefficients or identities. To help AI agents search for such algorithms, we provide a scaffold for playing with combinatorial objects, countering cheating attempts, and testing candidate solutions. To explore how far frontier AI systems can go on these problems, we collaborated with OpenAI, whose researchers obtained proposed solutions to several of them. This highlights bigger meta-problems: is AI discovery at scale ethical? How should these results be released? How should proof digestion be organized? We discuss these questions and give our views.

cs.AI↗

Noncrossing combinatorics of quasi-Coxeter elements

We study the combinatorics of the intervals below quasi-Coxeter elements in the absolute order of finite Coxeter groups. In particular, we prove that these intervals are EL-shellable, except possibly for quasi-Coxeter elements of types $E_7$ and $E_8$, and we compute their zeta polynomials. We also show that a total order of the reflections yields an EL-labeling if it does so on all rank-two subintervals, which proves a conjecture of Williams for Coxeter elements. In order to obtain these results, we prove them for the infinite families, and we treat the exceptional types by computer. In addition, we study the related interval monoids, and we find a counterexample to cancellativity for every proper quasi-Coxeter element of type $D_n$ ($n\ge5$), $E_6$, $E_7$, $E_8$; in particular, these monoids do not embed in the corresponding interval groups. This gives a negative answer to a question posed by Baumeister, Holt, Neaime, and Rees.

math.CO↗

Mapping Uncharted Symmetries: Machine Discovery in Combinatorics

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.

cs.LG↗