arxiv: 2511.02864 · v3 · pith:VCVJO6IAnew · submitted 2025-11-03 · 💻 cs.NE · cs.AI· math.CA· math.CO· math.MG

Mathematical exploration and discovery at scale

Bogdan Georgiev , Javier G\'omez-Serrano , Terence Tao , Adam Zsolt Wagner This is my paper

Pith reviewed 2026-05-18 01:15 UTC · model grok-4.3

classification 💻 cs.NE cs.AImath.CAmath.COmath.MG

keywords AlphaEvolvemathematical discoveryevolutionary searchlarge language modelscombinatoricsnumber theorygeometryanalysis

0 comments p. Extension

Add this Pith Number to your LaTeX paper

What is a Pith Number?

\usepackage{pith}
\pithnumber{VCVJO6IA}

Prints a linked pith:VCVJO6IA badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

The pith

AlphaEvolve uses LLM-guided evolution to rediscover and improve mathematical constructions across dozens of problems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper demonstrates that an evolutionary coding agent called AlphaEvolve can autonomously find novel mathematical constructions. It combines large language models with automated testing to propose, evaluate, and refine solutions. When applied to 67 problems in analysis, combinatorics, geometry, and number theory, the system matched the best known results in most cases and found better ones in several. In some instances it even turned finite results into general formulas that work for all inputs. This suggests a new way for AI to assist mathematicians in exploring complex problems.

Core claim

AlphaEvolve is a generic evolutionary coding agent that combines the generative capabilities of LLMs with automated evaluation in an iterative evolutionary framework that proposes, tests, and refines algorithmic solutions to challenging scientific and practical problems. To demonstrate its breadth, the system was tested on a list of 67 problems spanning mathematical analysis, combinatorics, geometry, and number theory. It rediscovered the best known solutions in most of the cases and discovered improved solutions in several. In some instances, AlphaEvolve is also able to generalize results for a finite number of input values into a formula valid for all input values. These results highlight

What carries the argument

AlphaEvolve, an iterative evolutionary framework that uses LLMs to generate candidate solutions and automated evaluation to rank and refine them over generations.

If this is right

Mathematical constructions can be discovered at scale with reduced human preparation time.
AI systems can generalize finite observations into infinite formulas in some cases.
Combining with proof assistants like AlphaProof can provide automated verification.
Exploration of vast search spaces becomes feasible for long-standing open problems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Such systems might help identify patterns that lead to new conjectures beyond the tested problems.
Integration with formal proof systems could turn discoveries into verified theorems more efficiently.
Extending the approach to symbolic mathematics rather than just algorithmic constructions could broaden its impact.

Load-bearing premise

The automated evaluation function inside the evolutionary loop correctly identifies and ranks better mathematical constructions without missing subtle improvements or introducing bias.

What would settle it

Finding a problem where AlphaEvolve outputs a construction that passes the automated tests but is later shown by mathematicians to be incorrect or suboptimal compared to known results.

read the original abstract

AlphaEvolve (Novikov et al., 2025) is a generic evolutionary coding agent that combines the generative capabilities of LLMs with automated evaluation in an iterative evolutionary framework that proposes, tests, and refines algorithmic solutions to challenging scientific and practical problems. In this paper we showcase AlphaEvolve as a tool for autonomously discovering novel mathematical constructions and advancing our understanding of long-standing open problems. To demonstrate its breadth, we considered a list of 67 problems spanning mathematical analysis, combinatorics, geometry, and number theory. The system rediscovered the best known solutions in most of the cases and discovered improved solutions in several. In some instances, AlphaEvolve is also able to generalize results for a finite number of input values into a formula valid for all input values. Furthermore, we are able to combine this methodology with Deep Think and AlphaProof in a broader framework where the additional proof-assistants and reasoning systems provide automated proof generation and further mathematical insights. These results demonstrate that large language model-guided evolutionary search can autonomously discover mathematical constructions that complement human intuition, at times matching or even improving the best known results, highlighting the potential for significant new ways of interaction between mathematicians and AI systems. We present AlphaEvolve as a powerful new tool for mathematical discovery, capable of exploring vast search spaces to solve complex optimization problems at scale, often with significantly reduced requirements on preparation and computation time.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

AlphaEvolve runs LLM evolutionary search across 67 math problems and reports rediscoveries plus a few improvements, but the abstract gives almost no numbers or verification details.

read the letter

The main point is that this paper takes an existing evolutionary LLM agent, AlphaEvolve, and applies it at scale to 67 problems in analysis, combinatorics, geometry, and number theory. It claims the system recovered the best-known solutions in most cases, found better ones in several, and in a few instances turned finite results into closed-form formulas that hold for all inputs. They also sketch a larger setup that feeds outputs into proof assistants like AlphaProof for further checking.

Referee Report

2 major / 2 minor

Summary. The manuscript presents AlphaEvolve, an LLM-guided evolutionary coding agent that iteratively proposes, evaluates, and refines algorithmic solutions to mathematical problems. Applied to a benchmark of 67 problems spanning analysis, combinatorics, geometry, and number theory, the system is claimed to rediscover the best-known solutions in most cases, discover improved solutions in several cases, and in some instances generalize finite results into closed-form expressions valid for all inputs. The approach is further combined with proof assistants such as AlphaProof for automated verification and insight generation.

Significance. If the empirical outcomes are robustly verified, the work demonstrates that large-scale evolutionary search augmented by generative models can systematically explore mathematical construction spaces, recovering known optima and occasionally surpassing them while reducing manual preparation time. The scale of 67 diverse problems and the integration with formal proof systems constitute a concrete step toward AI-assisted mathematical discovery that complements rather than replaces human insight.

major comments (2)

[Methods / Evaluation] The automated evaluation functions used inside the evolutionary loop are described only at a high level; no explicit specification is given for how correctness, optimality, or generalization from finite to infinite cases is verified for each problem class (analysis, combinatorics, etc.). Because the ranking of candidates and the claim of genuine improvements rest entirely on these functions being complete and unbiased, the absence of concrete fitness definitions, edge-case handling, or cross-validation procedures is load-bearing for the central empirical claims.
[Results] In the results for the 67 problems, the manuscript asserts rediscovery of best-known solutions in most cases and improvements in several, yet supplies neither per-problem quantitative deltas (previous optimum versus new value), nor error bars, nor explicit baseline comparisons. Without these data it is impossible to distinguish robust advances from possible artifacts of the evaluator or from incomplete search.

minor comments (2)

Notation for the evolutionary operators and LLM prompting templates is introduced without a consolidated table or diagram, making it difficult to reproduce the exact experimental protocol.
The abstract and introduction would benefit from one or two concrete, fully specified examples of an improved construction together with its verification.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive and detailed feedback on our manuscript. We address each major comment below and outline the revisions we will make to strengthen the presentation.

read point-by-point responses

Referee: [Methods / Evaluation] The automated evaluation functions used inside the evolutionary loop are described only at a high level; no explicit specification is given for how correctness, optimality, or generalization from finite to infinite cases is verified for each problem class (analysis, combinatorics, etc.). Because the ranking of candidates and the claim of genuine improvements rest entirely on these functions being complete and unbiased, the absence of concrete fitness definitions, edge-case handling, or cross-validation procedures is load-bearing for the central empirical claims.

Authors: We agree that the current description of the evaluation functions is at a high level and that greater specificity would improve reproducibility. In the revised manuscript we will expand the Methods section with explicit fitness definitions, edge-case handling protocols, and verification procedures for generalization from finite to closed-form results. These additions will be illustrated with concrete examples drawn from each problem class (analysis, combinatorics, geometry, number theory) and will include pseudocode where appropriate. revision: yes
Referee: [Results] In the results for the 67 problems, the manuscript asserts rediscovery of best-known solutions in most cases and improvements in several, yet supplies neither per-problem quantitative deltas (previous optimum versus new value), nor error bars, nor explicit baseline comparisons. Without these data it is impossible to distinguish robust advances from possible artifacts of the evaluator or from incomplete search.

Authors: We accept that per-problem quantitative detail is necessary to substantiate the claims. The revised version will include an appendix containing a table with previous best-known values, the solutions discovered by AlphaEvolve, and the corresponding deltas for all 67 problems (or a clear summary for the subset where improvements or generalizations occurred). We will also report variability across multiple independent runs for a representative sample of problems and add baseline comparisons against non-LLM evolutionary search. For generalization cases the evaluation metric differs by nature; we will explicitly note this distinction in the table. revision: yes

Circularity Check

0 steps flagged

No circularity: empirical rediscoveries on external benchmarks

full rationale

The paper applies the AlphaEvolve system to a fixed list of 67 independent mathematical problems drawn from analysis, combinatorics, geometry, and number theory. Reported outcomes consist of rediscoveries of best-known solutions and occasional improvements or generalizations, scored by an automated evaluator against external mathematical criteria. No equations, derivations, or parameter-fitting steps are described that would reduce the claimed results to quantities defined in terms of the system's own outputs or fitted values. The evaluation targets are external benchmarks rather than self-referential quantities, and no load-bearing self-citations or ansatzes are invoked to justify the core claims. This is a standard empirical demonstration on independent test cases.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work relies on standard mathematical evaluation criteria for the chosen problems and on the correctness of the LLM and evolutionary machinery; no new free parameters, axioms, or invented entities are introduced beyond those already present in the cited LLM and evolutionary literature.

axioms (1)

standard math Standard mathematical definitions and optimality criteria for the 67 problems in analysis, combinatorics, geometry, and number theory are well-defined and computable.
The automated evaluation step presupposes that these criteria can be checked mechanically without human judgment.

pith-pipeline@v0.9.0 · 5795 in / 1332 out tokens · 55506 ms · 2026-05-18T01:15:41.587385+00:00 · methodology

discussion (0)

Forward citations

Cited by 18 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

AI co-mathematician: Accelerating mathematicians with agentic AI
cs.AI 2026-05 unverdicted novelty 7.0

An interactive AI workbench for mathematicians achieves 48% on FrontierMath Tier 4 and helped solve open problems in early tests.
Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
math.OC 2026-05 unverdicted novelty 7.0

New nonlinear formulations for geometric packing problems, solved with FICO Xpress and SCIP, produce improved and first-known solutions for several variants.
$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture
cs.MS 2026-04 accept novelty 7.0

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.
Learning to Discover at Test Time
cs.LG 2026-01 unverdicted novelty 7.0

TTT-Discover applies test-time RL to set new state-of-the-art results on math inequalities, GPU kernels, algorithm contests, and single-cell denoising using an open model and public code.
GRAFT-ATHENA: Self-Improving Agentic Teams for Autonomous Discovery and Evolutionary Numerical Algorithms
cs.LG 2026-05 unverdicted novelty 6.0

GRAFT-ATHENA projects combinatorial method choices into factored trees that embed as fingerprints in a metric space, enabling an agentic system to accumulate experience across domains and autonomously discover new num...
AI co-mathematician: Accelerating mathematicians with agentic AI
cs.AI 2026-05 unverdicted novelty 6.0

An interactive AI workbench called the AI co-mathematician supports open-ended mathematical research and achieves a new high score of 48% on FrontierMath Tier 4.
Intentmaking and Sensemaking: Human Interaction with AI-Guided Mathematical Discovery
cs.AI 2026-05 unverdicted novelty 6.0

Expert mathematicians using an AI coding agent for discovery engage in repeated cycles of intentmaking to define goals and sensemaking to interpret outputs.
Using Large Language Models as a Co-Author in Undergraduate Quantum Group Research
math.HO 2026-05 unverdicted novelty 6.0

An AI model produced a new formula for a central element of U_q(so_12) at the quality level of advanced undergraduate research, along with faster computation via SageMath, prompting changes in mentorship practices.
Evaluation-driven Scaling for Scientific Discovery
cs.LG 2026-04 unverdicted novelty 6.0

SimpleTES scales test-time evaluation in LLMs to discover state-of-the-art solutions on 21 scientific problems across six domains, outperforming frontier models and optimization pipelines with examples like 2x faster ...
SPS: Steering Probability Squeezing for Better Exploration in Reinforcement Learning for Large Language Models
cs.CL 2026-04 unverdicted novelty 6.0

SPS interleaves RL and IRL to counteract probability squeezing in LLM reasoning trajectories, improving Pass@k on five benchmarks while identifying an empirical upper bound on multi-sample performance.
Computer Architecture's AlphaZero Moment: Automated Discovery in an Encircled World
cs.AR 2026-03 conditional novelty 6.0

Automated architectural discovery engines can outperform human design teams by exploring massive design spaces and compressing development cycles from months to weeks.
Benchmarking Compound AI Applications for Hardware-Software Co-Design
cs.DC 2026-03 unverdicted novelty 6.0

Introduces a benchmarking suite for compound AI applications to support cross-stack performance, cost, and resource analysis for hardware-software co-design.
How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity
math.CO 2025-11 unverdicted novelty 6.0

Deep learning identifies co-triangle-free graphs as e-positive and proves e-positivity for claw-free claw-contractible-free graphs on 10 and 11 vertices, resolving an open conjecture.
Grokability in five inequalities
math.PR 2026-05 unverdicted novelty 5.0

Five improved inequalities were found with AI help: better Gaussian perimeter bounds for convex sets, sharper L2-L1 moments on the Hamming cube, a strengthened autoconvolution inequality, improved g-Sidon set bounds, ...
Heterogeneous Scientific Foundation Model Collaboration
cs.AI 2026-04 unverdicted novelty 5.0

Eywa enables language-based agentic AI systems to collaborate with specialized scientific foundation models for improved performance on structured data tasks.
pAI/MSc: ML Theory Research with Humans on the Loop
cs.AI 2026-04 unverdicted novelty 5.0

pAI/MSc is a customizable multi-agent system that reduces human steering by orders of magnitude when turning a hypothesis into a literature-grounded, mathematically established, experimentally supported manuscript dra...
ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms
cs.LG 2025-12 unverdicted novelty 5.0

ATHENA introduces an agentic team framework that autonomously manages the end-to-end computational research lifecycle via a knowledge-driven HENA loop to achieve validation errors of 10^{-14} in scientific computing a...
AI for Mathematics: Progress, Challenges, and Prospects
math.HO 2026-01 unverdicted novelty 4.0

AI for math combines task-specific architectures and general foundation models to support research and advance AI reasoning capabilities.

Reference graph

Works this paper leans on

300 extracted references · 300 canonical work pages · cited by 17 Pith papers · 8 internal anchors

[1]

Accessed: 2025-09-27

Mathematical results Colab for AlphaEvolve paper.https://colab.research.google.com/github/google-deepmind/ alphaevolve_results/blob/master/mathematical_results.ipynb. Accessed: 2025-09-27

work page 2025
[2]

LowEigenvaluesofLaplaceandSchrödingerOperators

Problemsfromtheworkshopon“LowEigenvaluesofLaplaceandSchrödingerOperators”.AmericanInstituteofMathematicsWork- shop, May 2006

work page 2006
[3]

Erdős Problems database

Problem #106.https://www.erdosproblems.com/106, 2024. Erdős Problems database

work page 2024
[4]

J. M. Aldaz. Remarks on the Hardy–Littlewood maximal function.Proceedings of the Royal Society of Edinburgh: Section A Mathe- matics, 128(1):1–9, 1998

work page 1998
[5]

Decomposing a factorial into large factors

Boris Alexeev, Evan Conway, Matthieu Rosenfeld, Andrew V. Sutherland, Terence Tao, Markus Uhr, and Kevin Ventullo. Decom- posing a factorial into large factors, 2025. arXiv:2503.20170

work page internal anchor Pith review Pith/arXiv arXiv 2025
[6]

Global Lyapunov functions: a long-standing open problem in mathematics, with symbolic transformers

Alberto Alfarano, François Charton, and Amaury Hayat. Global Lyapunov functions: a long-standing open problem in mathematics, with symbolic transformers. InAdvances in Neural Information Processing Systems, volume 37. Curran Associates, Inc., 2024

work page 2024
[7]

Ashbaugh, Rafael D.Benguria, RichardS

Mark S. Ashbaugh, Rafael D.Benguria, RichardS. Laugesen, andTimo Weidl. Low Eigenvalues ofLaplace and Schrödinger Opera- tors.Oberwolfach Rep., 6(1):355–428, 2009

work page 2009
[8]

Extremal problems for convex polygons.Journal of Global Optimization, 38(2):163–179, 2010

Charles Audet, Xavier Fournier, Pierre Hansen, and Frédéric Messine. Extremal problems for convex polygons.Journal of Global Optimization, 38(2):163–179, 2010

work page 2010
[9]

K. I. Babenko. An inequality in the theory of Fourier integrals.Izv. Akad. Nauk SSSR Ser. Mat., 25:531–542, 1961

work page 1961
[10]

Optimality of Gerver’s Sofa, 2024

Jineon Baek. Optimality of Gerver’s Sofa, 2024. arXiv:2411.19826

work page arXiv 2024
[11]

JineonBaek,JunnosukeKoizumi,andTakahiroUeoro.AnoteontheErdosconjectureaboutsquarepacking,2024.arXiv:2411.07274

work page arXiv 2024
[12]

Balister, B

P. Balister, B. Bollobás, R. Morris, J. Sahasrabudhe, and M. Tiba. Flat Littlewood polynomials exist.Annals of Mathematics, 192(3):977–1004, 2020

work page 2020
[13]

The constant of point-line incidence constructions.Comput

Martin Balko, Adam Sheffer, and Ruiwen Tang. The constant of point-line incidence constructions.Comput. Geom., 114:14, 2023. Id/No 102009

work page 2023
[14]

B.Ballinger,G.Blekherman,H.Cohn,N.Giansiracusa,E.Kelly,andA.Schürmann.Experimentalstudyofenergy-minimizingpoint configurations on spheres.Experimental Mathematics, 18:257–283, 2009

work page 2009
[15]

Minimal Energy Configurations for N Points on a Sphere in n Dimensions.https://aimath.org/data/paper/BBCGKS2006/, 2006

Bradon Ballinger, Grigoriy Blekherman, Henry Cohn, Noah Giansiracusa, Elizabeth Kelly, and Achill Schürmann. Minimal Energy Configurations for N Points on a Sphere in n Dimensions.https://aimath.org/data/paper/BBCGKS2006/, 2006

work page 2006
[16]

Difference bases in cyclic groups.Journal of Algebra and Its Applications, 18(05):1950081, 2019

Taras O Banakh and Volodymyr M Gavrylkiv. Difference bases in cyclic groups.Journal of Algebra and Its Applications, 18(05):1950081, 2019

work page 2019
[17]

R.C.BarnardandS.Steinerberger.Threeconvolutioninequalitiesonthereallinewithconnectionstoadditivecombinatorics.Journal of Number Theory, 207:42–55, 2020

work page 2020
[18]

PaulBatemanandPaulErdős.GeometricalextremasuggestedbyalemmaofBesicovitch.AmericanMathematicalMonthly,58:306– 314, 1951

work page 1951
[19]

A.F.Beardon,D.Minda,andT.W.Ng.Smale’smeanvalueconjectureandthehyperbolicmetric.MathematischeAnnalen,332:623– 632, 2002

work page 2002
[20]

W. Beckner. Inequalities in Fourier analysis.Annals of Mathematics, 102(1):159–182, 1975

work page 1975
[21]

Bellec and Tobias Fritz

Pierre C. Bellec and Tobias Fritz. Optimizing over iid distributions and the beat the average game, 2024. arXiv:2412.15179

work page arXiv 2024
[22]

R.D.BenguriaandM.Loss.ConnectionbetweentheLieb-ThirringconjectureforSchrödingeroperatorsandanisoperimetricproblem for ovals on the plane.Contemporary Mathematics, 362:53–61, 2004

work page 2004
[23]

C. Berger. A strange dilation theorem.Notices of the American Mathematical Society, 12:590, 1965. Abstract 625–152

work page 1965
[24]

J. D. Berman and K. Hanes. Volumes of polyhedra inscribed in the unit sphere in𝐸3.Mathematische Annalen, 188:78–84, 1970

work page 1970
[25]

Best Global Optimization Solver

Timo Berthold. Best Global Optimization Solver. FICO Blog, June 2025. Accessed September 5, 2025

work page 2025
[26]

A. Bezdek. On the number of mutually touching cylinders. InCombinatorial and Computational Geometry, volume 52 ofMSRI Publication, pages 121–127. 2005

work page 2005
[27]

Extremal point sets.Proceedings of the American Mathematical Society, 127(1):165–173, 1999

András Bezdek and Ferenc Fodor. Extremal point sets.Proceedings of the American Mathematical Society, 127(1):165–173, 1999

work page 1999
[28]

Bezikovič

A. Bezikovič. Sur deux questions de l’intégrabilité des fonctions.J. Soc. Phys. Math. Univ. Perm, 2:105–123, 1919

work page 1919
[29]

Bhatia.Positive Definite Matrices

R. Bhatia.Positive Definite Matrices. Princeton Series in Applied Mathematics. Princeton University Press, Princeton, NJ, 2007

work page 2007
[30]

Bhatia and F

R. Bhatia and F. Kittaneh. The matrix arithmetic-geometric mean inequality revisited.Linear Algebra and its Applications, 428(8– 9):2177–2191, 2008

work page 2008
[31]

Blokhuis, A

A. Blokhuis, A. E. Brouwer, D. Jungnickel, V. Krčadinac, S. Rottey, L. Storme, T. Szőnyi, and P. Vandendriessche. Blocking sets of the classical unital.Finite Fields Appl., 35:1–15, 2015. 73

work page 2015
[32]

The finite field Kakeya problem

Aart Blokhuis and Francesco Mazzocca. The finite field Kakeya problem. InBuilding bridges. Between mathematics and computer science. Selected papers of the conferences held in Budapest, Hungary, August 5–9, 2008 and Keszthely, Hungary, August 11–15, 2008 and other research papers dedicated to László Lovász on the occasion of his 60th birthday, pages 205–2...

work page 2008
[33]

Thomas F. Bloom. A history of the sum-product problem.http://thomasbloom.org/notes/sumproduct.html, 2024. Online survey notes

work page 2024
[34]

Thomas F. Bloom. Control and its applications in additive combinatorics, 2025. arXiv:2501.09470

work page arXiv 2025
[35]

B. D. Bojanov, Q. I. Rahman, and J. Szynal. On a conjecture of Sendov about the critical points of a polynomial.Mathematische Zeitschrift, 190(2):281–285, 1985

work page 1985
[36]

Relations between sets of complete subgraphs

Béla Bollobás. Relations between sets of complete subgraphs. In C. St.J. A. Nash-Williams and J. Sheehan, editors,Proceedings of the Fifth British Combinatorial Conference, number XV in Congressus Numerantium, pages 79–84, Winnipeg, 1976. Utilitas Mathematica Publishing

work page 1976
[37]

Optimal asymptotic bounds for spherical designs.Annals of Math- ematics, 178(2):443–452, 2013

Andriy Bondarenko, Danylo Radchenko, and Maryna Viazovska. Optimal asymptotic bounds for spherical designs.Annals of Math- ematics, 178(2):443–452, 2013

work page 2013
[38]

The Sendov conjecture for polynomials with at most seven distinct zeros.Analysis, 16:137–159, 1996

Iulius Borcea. The Sendov conjecture for polynomials with at most seven distinct zeros.Analysis, 16:137–159, 1996

work page 1996
[39]

Cambridge University Press, Cambridge, 2008

P.BorweinandM.J.Mossinghoff.Barkersequencesandflatpolynomials.InNumbertheoryandpolynomials,volume352ofLondon Mathematical Society Lecture Note Series, pages 71–88. Cambridge University Press, Cambridge, 2008

work page 2008
[40]

J.Bourgain.Applicationsofthespacesofhomogeneouspolynomialstosomeproblemsontheballalgebra.ProceedingsoftheAmer- ican Mathematical Society, 93(2):277–283, feb 1985

work page 1985
[41]

JeanBourgain.Onuniformlyboundedbasesinspacesofholomorphicfunctions.AmericanJournalofMathematics,138(2):571–584, 2016

work page 2016
[42]

An improved example for an autoconvolution inequality, 2025

Christopher Boyer and Zane Kun Li. An improved example for an autoconvolution inequality, 2025. arXiv:2506.16750

work page arXiv 2025
[43]

SándorBozóki,Tsung-LinLee,andLajosRónyai.Sevenmutuallytouchinginfinitecylinders.ComputationalGeometry,48(2):87–93, 2014

work page 2014
[44]

Peter Brass, William O. J. Moser, and János Pach.Research Problems in Discrete Geometry. Springer, New York, 2005. Corrected 2nd printing 2006

work page 2005
[45]

Springer, 2005

Peter Brass, William OJ Moser, and János Pach.Research problems in discrete geometry. Springer, 2005

work page 2005
[46]

J. E. Brown. On the Sendov Conjecture for sixth degree polynomials.Proceedings of the American Mathematical Society, 113:939– 946, 1991

work page 1991
[47]

J.E.Brown.AproofoftheSendovConjectureforpolynomialsofdegreeseven.ComplexVariablesTheoryandApplication,33:75–95, 1997

work page 1997
[48]

J. E. Brown andG. Xiang. Proof of the Sendovconjecture for polynomials of degree at mosteight.Journal of Mathematical Analysis and Applications, 232:272–292, 1999

work page 1999
[49]

Sharp density bounds on the finite field Kakeya problem.Discrete Anal., 2021:9, 2021

Boris Bukh and Ting-Wei Chao. Sharp density bounds on the finite field Kakeya problem.Discrete Anal., 2021:9, 2021. Id/No 26

work page 2021
[50]

Burchard and L

A. Burchard and L. E. Thomas. On the Cauchy problem for a dynamical Euler’s elastica.Communications in Partial Differential Equations, 28:271–300, 2003

work page 2003
[51]

Burchard and L

A. Burchard and L. E. Thomas. On an isoperimetric inequality for a Schrödinger operator depending on the curvature of a loop.The Journal of Geometric Analysis, 15(4), 2005

work page 2005
[52]

Campbell and William Staton

Connie M. Campbell and William Staton. A Square-Packing Problem of Erdős.The American Mathematical Monthly, 112(2):165– 167, 2005

work page 2005
[53]

Optimal configurations for the Heilbronn problem in convex regions, June 2007

David Cantrell. Optimal configurations for the Heilbronn problem in convex regions, June 2007

work page 2007
[54]

Point configurations in 3D space minimizing maximum to minimum distance ratio, March 2009

David Cantrell. Point configurations in 3D space minimizing maximum to minimum distance ratio, March 2009

work page 2009
[55]

Point configurations minimizing maximum to minimum distance ratio, February 2009

David Cantrell. Point configurations minimizing maximum to minimum distance ratio, February 2009

work page 2009
[56]

Ellenberg, Adam Zsolt Wagner, and Geordie Williamson

François Charton, Jordan S. Ellenberg, Adam Zsolt Wagner, and Geordie Williamson. PatternBoost: Constructions in Mathematics with a Little Help from AI.arXiv preprint arXiv:2411.00566, 2024

work page arXiv 2024
[57]

P. L. Chebyshev. Mémoire sur les nombres premiers.Journal de Mathématiques Pures et Appliquées, 17:366–490, 1852. Also in Mémoires présentés à l’Académie Impériale des sciences de St.-Pétersbourg par divers savants 7 (1854), 15–33. Also in Oeuvres 1 (1899), 49–70

work page
[58]

W.CheungandT.Ng.Acompanionmatrixapproachtothestudyofzerosandcriticalpointsofapolynomial.JournalofMathematical Analysis and Applications, 319:690–707, 2006

work page 2006
[59]

Cloninger and S

A. Cloninger and S. Steinerberger. On suprema of autoconvolutions with an application to Sidon sets.Proceedings of the American Mathematical Society, 145(8):3191–3200, 2017

work page 2017
[60]

Lower bounds for incidences, 2024

Alex Cohen, Cosmin Pohoata, and Dmitrii Zakharov. Lower bounds for incidences, 2024. arXiv:2409.07658

work page arXiv 2024
[61]

Cohn and N

H. Cohn and N. Elkies. New upper bounds on sphere packings I.Annals of Mathematics, 157(2):689–714, 2003

work page 2003
[62]

Cohn and F

H. Cohn and F. Gonçalves. An optimal uncertainty principle in twelve dimensions via modular forms.Inventiones Mathematicae, 217(3):799–831, 2019

work page 2019
[63]

Stability Configurations of Electrons on a Sphere.Mathematical Tables and Other Aids to Computation, 10(55):117– 120, 1956

Harvey Cohn. Stability Configurations of Electrons on a Sphere.Mathematical Tables and Other Aids to Computation, 10(55):117– 120, 1956

work page 1956
[64]

HenryCohn.Orderanddisorderinenergyminimization.ProceedingsoftheInternationalCongressofMathematicians,4:2416–2443, 2010

work page 2010
[65]

Table of spherical codes

Henry Cohn. Table of spherical codes. MIT DSpace, 2023. Dataset archiving spherical codes with up to 1024 points in up to 32 dimensions

work page 2023
[66]

Table of Kissing Number Bounds

Henry Cohn. Table of Kissing Number Bounds. MIT DSpace, 2025

work page 2025
[67]

Universally Optimal Distribution of Points on Spheres.Journal of the American Mathematical Society, 20(1):99–148, 2007

Henry Cohn and Abhinav Kumar. Universally Optimal Distribution of Points on Spheres.Journal of the American Mathematical Society, 20(1):99–148, 2007. 74

work page 2007
[68]

HenryCohn,AbhinavKumar,StephenD.Miller,DanyloRadchenko,andMarynaViazovska.Thespherepackingproblemindimen- sion 24.Annals of Mathematics, 185(3):1017–1033, 2017

work page 2017
[69]

Improved kissing numbers in seventeen through twenty-one dimensions.arXiv:2411.04916, 2024

Henry Cohn and Anqi Li. Improved kissing numbers in seventeen through twenty-one dimensions.arXiv:2411.04916, 2024

work page arXiv 2024
[70]

Collins, Albert Q

Katherine M. Collins, Albert Q. Jiang, Simon Frieder, Lionel Wong, Miri Zilka, Umang Bhatt, Thomas Lukasiewicz, Yuhuai Wu, Joshua B. Tenenbaum, William Hart, Timothy Gowers, Wenda Li, Adrian Weller, and Mateja Jamnik. Evaluating language models for mathematics through interactions.Proceedings of the National Academy of Sciences, 121(24):e2318124121, 2024

work page 2024
[71]

Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities

Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, et al. Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities.arXiv preprint arXiv:2507.06261, 2025

work page internal anchor Pith review Pith/arXiv arXiv 2025
[72]

DavidConlon,JacobFox,andBennySudakov.AnapproximateversionofSidorenko’sconjecture.GeometricandFunctionalAnalysis, 20:1354–1366, 2010

work page 2010
[73]

Sidorenko’s conjecture for higher tree decompositions, 2018

David Conlon, Jeong Han Kim, Choongbum Lee, and Joonkyung Lee. Sidorenko’s conjecture for higher tree decompositions, 2018. Unpublished note

work page 2018
[74]

Some advances on Sidorenko’s conjecture.Journal of the London Mathematical Society, 98(2):593–608, 2018

David Conlon, Jeong Han Kim, Choongbum Lee, and Joonkyung Lee. Some advances on Sidorenko’s conjecture.Journal of the London Mathematical Society, 98(2):593–608, 2018

work page 2018
[75]

Sidorenko’s conjecture for blow-ups.Discrete Analysis, 2021(2):13, 2021

David Conlon and Joonkyung Lee. Sidorenko’s conjecture for blow-ups.Discrete Analysis, 2021(2):13, 2021

work page 2021
[76]

Conte, E

A. Conte, E. Fujikawa, and N. Lakic. Smale’s mean value conjecture and the coefficients of univalent functions.Proceedings of the American Mathematical Society, 135(12):3819–3833, 2007

work page 2007
[77]

KrisCoolsaet,SvenD’hondt,andJanGoedgebeur.HouseofGraphs2.0: Adatabaseofinterestinggraphsandmore.DiscreteApplied Mathematics, 325:97–107, 2023

work page 2023
[78]

The Kakeya maximal function and the spherical summation multipliers.Am

Antonio Cordoba. The Kakeya maximal function and the spherical summation multipliers.Am. J. Math., 99:1–22, 1977

work page 1977
[79]

An optimization problem related to balancing loads on SONET rings.Telecommunication Systems, 3(2):165–181, 1994

Steve Cosares and Iraj Saniee. An optimization problem related to balancing loads on SONET rings.Telecommunication Systems, 3(2):165–181, 1994

work page 1994
[80]

E.Crane.AboundforSmale’smeanvalueconjectureforcomplexpolynomials.BulletinoftheLondonMathematicalSociety,39:781– 791, 2007

work page 2007

Showing first 80 references.