This work was supported by Schmidt Sciences.
Interested in purchasing access to solution verifiers? Contact math@epoch.ai.
Ramsey Numbers for Book Graphs
Prove a tight lower bound on Ramsey numbers for a class of off-diagonal book graphs.
A Ramsey-style Problem on Hypergraphs
Construct hypergraphs as large as possible that do not have a certain easy-to-check, difficult-to-find property.
Finiteness Problem for Diophantine Equations
Prove that certain “small” Diophantine equations have infinitely many solutions.
The Arithmetic Kakeya Conjecture
Improve best-known upper bounds by constructing specific combinatorial objects.
Degree vs Sensitivity for Boolean Functions
Improve the exponent in the upper bound that degree has over sensitivity.
Surface with a High Number of Singularities
Present a KLT del Pezzo surface in characteristic 3 with more than 7 singular points.