7 papers
New Records for the Hadamard Maximal Determinant Problem
Giorgi Butbaia, Pragatheeswaran Vipulanandan, Justin Tan +6
The Hadamard maximal determinant problem seeks an matrix with entries in , which maximizes the determinant for a given order $n \in…
New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction
Paul Orland, Lucas Fagan, Michele Tarquini +7
The snake-in-the-box problem asks for a longest induced path in the hypercube graph . We find a length-191 snake in dimension , the lowest dimension where the maximum is…
Hierarchical Reinforcement Learning for Sparse-Reward Search in Commutative Algebra
Giorgi Butbaia, Paul Orland, Coco Huang +7
Applying machine learning techniques to solving long-standing mathematical conjectures can be particularly challenging due to their extreme reward sparsity. As an illustrative exam…
The Two-Hump Problem: Bridging the Difficulty Gap in Mathematical Reinforcement Learning
Lucas Fagan, Michele Tarquini, Ali Shehper +6
Mathematical search problems present a unique challenge for Reinforcement Learning (RL) due to vast search spaces and sparse rewards. In previous works, the Andrews-Curtis (AC) con…
Stable Andrews-Curtis Conjecture via Fake Surfaces and Zeeman Conjecture
Lucas Fagan, Yang Qiu, Zhenghan Wang
We propose an induction scheme that aims at establishing the stable Andrews-Curtis conjecture in the affirmative. The stable Andrews-Curtis conjecture is equivalent to the conjectu…
What makes math problems hard for reinforcement learning: a case study
Ali Shehper, Anibal M. Medina-Mardones, Lucas Fagan +6
Using a long-standing conjecture from combinatorial group theory, we explore, from multiple perspectives, the challenges of finding rare instances carrying disproportionately high…
Classification of Cellular Fake Surfaces
Lucas Fagan, Yang Qiu, Zhenghan Wang
Generic polyhedra are interesting mathematical objects to study in their own right. In this paper, we initialize a systematic study of two-dimensional generic polyhedra with an eye…