Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

OAI Math

All of openAI's results.

https://github.com/openai/math

317 missions

Missions

126–150 of 317
Open0Completed317All317
🏆Completed
CombinatoricsDiscrete Geometry·Captain: marwahaha

A translational tile with no fully periodic tiling in dimension threeOpen Problem

A tile may admit a translation tiling while forcing every such tiling to lack a full lattice of periods. The mission asks for this phenomenon in dimension three and its persistence under Euclidean thickening. The source manuscript presents the surrounding research claim.

2 thms2 active usersReviewed
🏆Completed
Differential GeometryDynamical Systems·Captain: marwahaha

A zero-entropy system without a smooth positive-volume modelOpen Problem

A measure-preserving system may have low information production yet fail to admit a smooth realization. The target asks for a single ergodic system excluding every finite-dimensional smooth positive-volume model. The source manuscript presents the surrounding research claim.

5 thms2 active usersReviewed
🏆Completed
Algebraic TopologyDynamical Systems·Captain: marwahaha

A C^1 Counterexample to the Entropy ConjectureOpen Problem

Topological entropy measures orbit complexity, whereas the induced map on homology measures algebraic growth. The mission asks for a C¹ self-map where these two measurements violate the proposed entropy lower bound. The source manuscript presents the surrounding research claim.

4 thms2 active usersReviewed
🏆Completed
AnalysisDynamical Systems·Captain: marwahaha

Positive Metric Entropy for the Standard Map at Large ParametersOpen Problem

The standard map is a concrete area-preserving torus system whose global chaotic behavior is difficult to infer from local stretching. The target asks for positive metric entropy along an entire large-parameter tail. The source manuscript presents the surrounding research claim.

22 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: marwahaha

Subpolynomial query complexity for well-conditioned log-concave samplingOpen Problem

Sampling costs can be measured by potential and gradient queries independently of the computation between them. This model isolates the information needed for a well-conditioned log-concave distribution. The source manuscript presents the surrounding research claim.

4 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

An exponential state lower bound for two-way nondeterministic complementationOpen Problem

Allowing a finite automaton to move its head in both directions complicates the state cost of language complement. A lower bound independent of alphabet size must handle alphabets that grow with the witness. The source manuscript presents the surrounding research claim.

51 thms2 active usersReviewed
🏆Completed
AnalysisTheoretical Computer Science·Captain: marwahaha

Average sensitivity of polynomial threshold functionsOpen Problem

Average sensitivity measures how often a Boolean decision changes after one coordinate flip. For polynomial threshold rules, a degree-sensitive estimate limits the total influence of all coordinates. The source manuscript presents the surrounding research claim.

20 thms2 active usersReviewed
🏆Completed
Convex OptimizationTheoretical Computer Science·Captain: marwahaha

Exponential PSD rank of positively shifted matching matricesOpen Problem

Semidefinite representations may be smaller than linear descriptions of a polytope. Lower bounds for their matrix size require a factorization obstruction that applies to arbitrary positive-semidefinite factors. The source manuscript presents the surrounding research claim.

79 thms2 active usersReviewed
🏆Completed
AlgebraTheoretical Computer Science·Captain: marwahaha

Polynomial Hitting Lists for Noncommutative Rational FormulasOpen Problem

Inversion gates create domains of definition as well as nonzero-value conditions. A rational hitting list must find a point where every inverse exists and where the final value is invertible. The source manuscript presents the surrounding research claim.

7 thms2 active usersReviewed
🏆Completed
AlgebraTheoretical Computer Science·Captain: marwahaha

One Rational Matrix Hitting Point for Noncommutative FormulasOpen Problem

Testing a noncommutative polynomial at scalar points can lose its ordered-word structure. Matrix evaluation preserves noncommutativity and permits a single prescribed tuple to test an entire bounded-size formula class. The source manuscript presents the surrounding research claim.

27 thms2 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: marwahaha

One Sample Suffices for Matroid Prophet Inequalities against an Almighty AdversaryOpen Problem

Online selection must commit before all values arrive, while the offline optimum sees the full vector. The mission asks how much one independent sample per item can recover under a matroid feasibility constraint. The source manuscript presents the surrounding research claim.

9 thms2 active usersReviewed
🏆Completed
Linear algebraTheoretical Computer Science·Captain: marwahaha

Complex Matrix Multiplication Below 2.258 and Rectangular BoundsOpen Problem

Rectangular matrix products arise when the two outer dimensions are much larger than the inner dimension. The dual exponent records the largest inner growth rate compatible with arithmetic exponent two. The source manuscript presents the surrounding research claim.

4 thms2 active usersReviewed
🏆Completed
AlgebraConvex Optimization·Captain: marwahaha

A nonspectrahedral hyperbolicity coneOpen Problem

Hyperbolic polynomials define convex optimization regions through real-rooted line restrictions. A spectrahedral representation would describe the same region by one finite symmetric positive-semidefinite matrix inequality. The source manuscript presents the surrounding research claim.

35 thms2 active usersReviewed
🏆Completed
Discrete Geometry·Captain: marwahaha

Translative covering densities of order n log nOpen Problem

The worst covering density over convex bodies measures how much overlap is unavoidable when translations must cover all of space. Comparing unrestricted centers with a single lattice separates two geometric constraints. The source manuscript presents the surrounding research claim.

12 thms2 active usersReviewed
🏆Completed
Discrete Geometry·Captain: marwahaha

A single-lattice covering bound of order n log nOpen Problem

Covering Euclidean space with translates of one body becomes more restrictive when every center must lie in a single lattice. The mission asks for a density bound with the optimal-order n log n shape claimed in the manuscript. The source manuscript presents the surrounding research claim.

5 thms2 active usersReviewed
🏆Completed
AnalysisDiscrete Geometry·Captain: marwahaha

The symmetric Mahler conjecture and its equality casesOpen Problem

The volume of a symmetric convex body multiplied by the volume of its polar is unchanged by invertible linear coordinates. Its extremizers are therefore classified up to linear equivalence. The source manuscript presents the surrounding research claim.

12 thms2 active usersReviewed
🏆Completed
AnalysisCombinatorics·Captain: marwahaha

The dyadic case of the Erdős similarity conjectureOpen Problem

Finite patterns fit inside positive-measure sets after a sufficiently small affine change. The dyadic similarity problem asks whether one particular infinite pattern can be excluded even from compact sets of nearly full measure. The source manuscript presents the surrounding research claim.

48 thms2 active usersReviewed
🏆Completed
AnalysisHarmonic Analysis·Captain: marwahaha

Riesz transforms and uniform rectifiability in higher codimensionOpen Problem

Singular integral estimates can detect geometric regularity in a measure whose support has no given parametrization. The mission turns a uniform Riesz-transform bound into uniform pieces of Lipschitz images. The source manuscript presents the surrounding research claim.

13 thms2 active usersReviewed
🏆Completed
AnalysisCombinatorics·Captain: marwahaha

Asymptotically minimal maxima of real Littlewood polynomialsOpen Problem

Choosing real signs in a polynomial controls how much its values can peak around the unit circle. The target seeks asymptotically optimal maximum modulus at every sufficiently large length. The source manuscript presents the surrounding research claim.

26 thms2 active usersReviewed
🏆Completed
Analysis·Captain: marwahaha

A strict inverse-first-power bound for univalent functionsOpen Problem

Integral-means spectra record the worst derivative concentration among normalized conformal maps. A strict bound at exponent −1 tests a specific predicted value of that spectrum. The source manuscript presents the surrounding research claim.

7 thms2 active usersReviewed
🏆Completed
Analysis·Captain: marwahaha

Brennan's conjecture and sharp inverse-square integral meansOpen Problem

The size of the derivative of a conformal map can concentrate near a domain boundary. Brennan-type integrability and inverse-square integral means quantify how severe that concentration can be. The source manuscript presents the surrounding research claim.

8 thms2 active usersReviewed
🏆Completed
Algebraic GeometryDifferential Geometry·Captain: marwahaha

Ample rank-two bundles on the quadric surface without Griffiths-positive metricsOpen Problem

Algebraic ampleness and positivity of a smooth Hermitian metric are different kinds of positivity for a vector bundle. The target asks for one concrete family where they separate. The source manuscript presents the surrounding research claim.

5 thms2 active usersReviewed
🏆Completed
AlgebraAlgebraic Geometry·Captain: marwahaha

An explicit noncoordinate polynomial with affine three-space zero fibreOpen Problem

A hypersurface can be abstractly affine space without its defining equation being an ambient coordinate. Distinguishing these two properties is the embedding question behind the Abhyankar–Sathaye problem. The source manuscript presents the surrounding research claim.

44 thms2 active usersReviewed
🏆Completed
Algebraic Geometry·Captain: marwahaha

The reverse logarithmic Kodaira inequality and additivityOpen Problem

Logarithmic Kodaira dimension measures the supply of pluricanonical forms allowed poles along a boundary. Its behavior in a fibration depends especially on the case where a general fiber has no such nonzero forms. The source manuscript presents the surrounding research claim.

14 thms2 active usersReviewed
🏆Completed
Graph TheoryNumber Theory·Captain: marwahaha

Bounded-Step Walks on Gaussian PrimesOpen Problem

A planar prime walk can go around a gap that would block a walk on a line. The Gaussian moat problem therefore asks for an obstruction to every possible bounded-step route through distinct Gaussian primes. The source manuscript presents the surrounding research claim.

2 thms2 active usersReviewed
PreviousPage 6 of 13Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1DBdbenbenn24962643
2EYEyal199010981568
3SCShuze Chen8223255
4FIfizzyinc34100
5MAmarwahaha5672
6POpolylog448
7WUwurtle35882
8ECEthan Cheung Wang2815
9WIWillR202
10YXYuxuan Xu1834

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me