Advancing Geometry with AI: Multi-agent Generation of Polytopes
Not on the map. Why?
Abstract (arXiv)
Polytopes are one of the most primitive concepts underlying geometry. Discovery and study of polytopes with complex structures provides a means of advancing scientific knowledge. Construction of polytopes with specific extremal structure is very difficult and time-consuming. Having an automated tool for the generation of such extremal examples is therefore of great value. We present an Artificial Intelligence system capable of generating novel polytopes with very high complexity, whose abilities we demonstrate in three different and challenging scenarios: the Hirsch Conjecture, the k-neighbourly problem and the longest monotone paths problem. For each of these three problems the system was able to generate novel examples, which match or surpass the best previously known bounds. Our main focus was the Hirsch Conjecture, which had remained an open problem for over 50 years. The highly parallel A.I. system presented in this paper was able to generate millions of examples, with many of them surpassing best known previous results and possessing properties not present in the earlier human-constructed examples. For comparison, it took leading human experts over 50 years to handcraft the first example of a polytope exceeding the bound conjectured by Hirsch, and in the decade since humans were able to construct only a scarce few families of such counterexample polytopes. With the adoption of computer-aided methods, the creation of new examples of mathematical objects stops being a domain reserved only for human expertise. Advances in A.I. provide mathematicians with yet another powerful tool in advancing mathematical knowledge. The results presented demonstrate that A.I. is capable of addressing problems in geometry recognized as extremely hard, and also to produce extremal examples different in nature from the ones constructed by humans.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jan 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 4; 2026: 5.
9 papers.
- 2026A Survey of Agentic Reasoning for Large Language Models: Towards Recursively Self-Improving and Collective Agentscited by 47
- 2025Has the Creativity of Large-Language Models peaked? An analysis of inter- and intra-LLM variabilitycited by 6
- 2025CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphscited by 5
- 2025Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problemscited by 3
- 2025CayleyPy Growth: Efficient growth computations and hundreds of new conjectures on Cayley graphs (Brief version)cited by 1
- 2026Improved Upper Bounds for Slicing the Hypercubecited by 1
- 2026LLM Framework for Discovering Major Mathematical Conjectures: AI's Quest for the Next Riemann Hypothesiscited by 1
- 2026Early Evidence of Vibe-Proving with Consumer LLMs: A Case Study on Spectral Region Characterization with ChatGPT-5.2 (Thinking)cited by 0
- 2026Hierarchical Reinforcement Learning for Sparse-Reward Search in Commutative Algebracited by 0
- 2026Hierarchical Reinforcement Learning for Sparse-Reward Search in Commutative Algebra22 Jun 2026
- 2026LLM Framework for Discovering Major Mathematical Conjectures: AI's Quest for the Next Riemann Hypothesis19 Apr 2026
- 2026Early Evidence of Vibe-Proving with Consumer LLMs: A Case Study on Spectral Region Characterization with ChatGPT-5.2 (Thinking)21 Feb 2026
- 2026Improved Upper Bounds for Slicing the Hypercube6 Feb 2026
- 2026A Survey of Agentic Reasoning for Large Language Models: Towards Recursively Self-Improving and Collective Agents18 Jan 2026
- 2025CayleyPy Growth: Efficient growth computations and hundreds of new conjectures on Cayley graphs (Brief version)23 Sep 2025
- 2025Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems29 May 2025
- 2025Has the Creativity of Large-Language Models peaked? An analysis of inter- and intra-LLM variability10 Apr 2025
- 2025CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs25 Feb 2025