Mapping Uncharted Symmetries: Machine Discovery in Combinatorics

• URL: http://arxiv.org/abs/2605.19063v1
• Date: Mon, 18 May 2026 19:36:08 GMT
• Title: Mapping Uncharted Symmetries: Machine Discovery in Combinatorics
• Abstract summary: We show that modern machine learning can meaningfully contribute to verifiable mathematical discoveries.<n>In particular, we focus on the construction of simple mathematical functions under exact distributional constraints.<n>We find a new interpretation of $q,t$-Narayanas arising from representation theory.
• Score: 38.59031747973091
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Efficient Learning and Symmetry Discovery under Exact Invariances [62.27019402162741]
  Learning with group invariances is central to many scientific and geometric learning problems.<n>It has been unclear whether one can efficiently compute a regression function that is exactly in subgroup to a given group action.<n>We present the first-time algorithm for learning with exact group invariants that applies uniformly to finite and infinite groups.
  arXiv  Detail & Related papers  (2026-09-07T04:35:19Z)
• MathlibLemma: Folklore Lemma Generation and Benchmark for Formal Mathematics [51.65118519899584]
  We introduce MathlibLemma, the first LLM-based multi-agent system to automate the discovery and formalization of mathematical folklore lemmas.<n>We further construct the MathlibLemma benchmark, a suite of 4,028 type-checked Lean statements spanning a broad range of mathematical domains.
  arXiv  Detail & Related papers  (2026-01-30T15:24:42Z)
• From Black Box to Bijection: Interpreting Machine Learning to Build a Zeta Map Algorithm [2.3895981099137535]
  We propose a new workflow for discovering explicit bijections via machine learning.<n>As a proof of concept, we train a transformer on paired Dyck paths and use its learned attention patterns to derive a new algorithmic description of the zeta map.
  arXiv  Detail & Related papers  (2025-11-16T02:17:37Z)
• Learning single-index models via harmonic decomposition [21.065469907392643]
  We study the problem of learning single-index models, where the label $y in mathbbR$ depends on the input $boldsymbolx in mathbbRd$ only through an unknown one-dimensional projection.<n>We introduce two families of estimators -- based on tensor unfolding and online SGD -- that respectively achieve either optimal sample complexity or optimal runtime.
  arXiv  Detail & Related papers  (2025-06-11T15:59:53Z)
• Llemma: An Open Language Model For Mathematics [46.557804525919785]
  We present Llemma, a large language model for mathematics. On the MATH benchmark Llemma outperforms all known open base models. Llemma is capable of tool use and formal theorem proving without any further finetuning.
  arXiv  Detail & Related papers  (2023-10-16T17:54:07Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• Permutation Invariant Representations with Applications to Graph Deep Learning [8.403227482145297]
  This paper presents two Euclidean embeddings of quotient space generated by matrices that are identified modulo arbitrary row permutations. An almost everywhere injective scheme can be implemented with minimal redundancy and low computational cost.
  arXiv  Detail & Related papers  (2022-03-14T23:13:59Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• Settling the Robust Learnability of Mixtures of Gaussians [19.229475414802213]
  We give the first provably robust algorithm for learning mixtures of any constant number of Gaussians. At the heart of our algorithm is a new method for proving dimension-independent identifiability. We show how the symbolic identities we derive can be directly used to analyze a natural sum-of-squares relaxation.
  arXiv  Detail & Related papers  (2020-11-06T22:36:00Z)
• Optimal Approximations Made Easy [1.2183405753834562]
  The goal of this paper is to give a modular, self-contained, intuitive proof of this result for finite set systems. This makes the proof accessible to a wider audience, readers not familiar with techniques from statistical learning theory, and makes it possible to be covered in a single self-contained lecture.
  arXiv  Detail & Related papers  (2020-08-20T13:58:14Z)
• Lattice Representation Learning [6.427169570069738]
  We introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be computed explicitly using lattice quantization, yet they can be learned efficiently using the ideas we introduce. This article will focus on laying the groundwork for exploring and exploiting the first two properties, including a new mathematical result linking expressions used during training and inference time and experimental validation on two popular datasets.
  arXiv  Detail & Related papers  (2020-06-24T16:05:11Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.