Machine learning methods discover a new noncrossing-partition statistic interpreting q,t-Narayana polynomials and yield a combinatorial proof of their symmetry.
hub Mixed citations
ArXiv abs/2104.14516 (2021)
Mixed citation behavior. Most common role is background (67%).
12
Pith papers citing it
Background
67% of classified citations
hub tools
citation-role summary
background 4
method 2
citation-polarity summary
representative citing papers
Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
k-server-bench formulates potential-function discovery for the k-server conjecture as a code-based inequality-satisfaction task; current agents fully solve the resolved k=3 case and reduce violations on the open k=4 case.
RLGT is a modular reinforcement learning framework for extremal graph theory that handles undirected, directed, looped, and multi-colored graphs to facilitate future research.
Transformers generate new FRSTs of 4D reflexive polytopes across size ranges and self-improve by retraining on their own outputs.
Geometry-aware MCTS with incremental constraint updates and symmetry pruning yields new best-known configurations for five of six tested combinatorial geometry problems, including ~1.8n points for Max-N3IL on grids 82-119.
A genetic algorithm generates new extreme examples of small heights, many preperiodic points, long cycles, and long tails for polynomials up to degree 13 and rational functions up to degree 5.
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.
AI agents exploring Platonic mathematical structures via proof hypergraphs may reveal the overall architecture of formal mathematics and what makes parts of it human-accessible.
AI for math combines task-specific architectures and general foundation models to support research and advance AI reasoning capabilities.
TxGraffiti is a data-driven heuristic program for generating conjectures in graph theory, with a new web interface for interactive exploration.
The paper proposes a bidirectional continuum between LLMs and control systems, covering LLM-assisted controller design, control-based LLM steering, and state-space modeling of LLMs.
citing papers explorer
-
Mapping Uncharted Symmetries: Machine Discovery in Combinatorics
Machine learning methods discover a new noncrossing-partition statistic interpreting q,t-Narayana polynomials and yield a combinatorial proof of their symmetry.
-
Some results on small ordered and cyclic Ramsey numbers
Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
-
$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture
k-server-bench formulates potential-function discovery for the k-server conjecture as a code-based inequality-satisfaction task; current agents fully solve the resolved k=3 case and reduce violations on the open k=4 case.
-
RLGT: A reinforcement learning framework for extremal graph theory
RLGT is a modular reinforcement learning framework for extremal graph theory that handles undirected, directed, looped, and multi-colored graphs to facilitate future research.
-
Generating Special Triangulations with Transformers
Transformers generate new FRSTs of 4D reflexive polytopes across size ranges and self-improve by retraining on their own outputs.
-
Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry
Geometry-aware MCTS with incremental constraint updates and symmetry pruning yields new best-known configurations for five of six tested combinatorial geometry problems, including ~1.8n points for Max-N3IL on grids 82-119.
-
A Genetic Algorithm for Generating Extreme Examples in Arithmetic Dynamics
A genetic algorithm generates new extreme examples of small heights, many preperiodic points, long cycles, and long tails for polynomials up to degree 13 and rational functions up to degree 5.
-
Mathematical exploration and discovery at scale
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.
-
Artificial Intelligence and the Structure of Mathematics
AI agents exploring Platonic mathematical structures via proof hypergraphs may reveal the overall architecture of formal mathematics and what makes parts of it human-accessible.
-
AI for Mathematics: Progress, Challenges, and Prospects
AI for math combines task-specific architectures and general foundation models to support research and advance AI reasoning capabilities.
-
Automated conjecturing with \emph{TxGraffiti}
TxGraffiti is a data-driven heuristic program for generating conjectures in graph theory, with a new web interface for interactive exploration.
-
When control meets large language models: From words to dynamics
The paper proposes a bidirectional continuum between LLMs and control systems, covering LLM-assisted controller design, control-based LLM steering, and state-space modeling of LLMs.