Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

OAI Math

All of openAI's results.

https://github.com/openai/math

317 completed missions

Missions

201–225 of 317
Open0Completed317All317
🏆Completed
Markov ChainProbabilityRepresentation Theory·Captain: wurtle

Conditional coordinate sweeps and analytic transferResearch Paper

The Thorp shuffle cuts a deck in half, pairs cards in corresponding positions, and lets an independent fair coin order each pair before the pairs are interleaved. On N=2dN=2^dN=2d cards, removing the deterministic rotation of coordinates turns ddd physical shuffles into one binary coordinate sweep: in each coordinate direction, in order, every pair of positions…

10 thms2 active usersReviewed
🏆Completed
Markov ChainProbabilityRepresentation Theory·Captain: wurtle

Random-subspace tests and trace smoothing for coordinate sweepsResearch Paper

The Thorp shuffle is a simple card-shuffling rule: cut a deck of nnn cards into two equal halves, pair cards in corresponding positions, and let an independent fair coin decide the order within each pair when the pairs are interleaved. It is a standard test case for mixing-time methods and a building block in small-domain enciphering schemes. For n=2dn=2^dn=2d every…

5 thms2 active usersReviewed
🏆Completed
Group TheoryProbabilityRepresentation Theory·Captain: wurtle

From partial permutation information to Fourier boundsResearch Paper

Many random permutations are analysed through what they do to a few labels at a time: the joint positions of kkk chosen cards in a shuffle, or the images of a list of inputs under a block cipher built from a shuffle. Such partial information does not by itself control the whole permutation. The uniform law on the alternating group already has uniform images…

46 thms2 active usersReviewed
🏆Completed
CombinatoricsMathematical PhysicsProbability·Captain: wurtle

Critical strip-crossing mass on the honeycomb latticeResearch Paper

At its critical weight, a self-avoiding path on the honeycomb lattice can make long excursions without paying an exponential cost. A basic quantitative question is how much of its total weight reaches the far side of a strip of height NNN. Physics heuristics (Nienhuis's Coulomb gas and the conjectured SLE8/3\mathrm{SLE}_{8/3}SLE8/3​ scaling limit with boundary exponent 5/85/85/8…

14 thms2 active usersReviewed
🏆Completed
Dynamical SystemsMathematical PhysicsProbability·Captain: wurtle

The sharp factor-of-IID threshold for the free Ising model on regular treesResearch Paper

A random configuration on the vertices of a graph is a factor of IID if it can be produced by a measurable rule from independent uniform labels at the vertices, where the rule commutes with the graph's automorphisms. On trees this notion connects ergodic theory (which invariant processes are "Bernoulli-like"), local algorithms on sparse random graphs…

26 thms2 active usersReviewed
🏆Completed
CombinatoricsMathematical LogicProbability·Captain: wurtle

Computing the Random 3-SAT ThresholdResearch Paper

Random 3-SAT, a conjunction of random three-literal clauses on nnn variables, is the classic test case for the typical behavior of satisfiability. Experiments placed the hardest instances near the density where half the formulas are satisfiable, and statistical physics predicts a sharp satisfiability threshold near 4.2674.2674.267. Once a limiting threshold α3\alpha_3α3​ is…

20 thms2 active usersReviewed
🏆Completed
CombinatoricsProbabilityTheoretical Computer Science·Captain: wurtle

Variance of the Random k-SAT Hitting TimeResearch Paper

Add random clauses one at a time to a Boolean formula on nnn variables until it first becomes unsatisfiable. The index HnH_nHn​ of that first failure is the satisfiability hitting time of random kkk-SAT. Its mean, divided by nnn, converges to the satisfiability threshold; its variance measures the width of the transition window. Friedgut's sharp-threshold theorem…

32 thms2 active usersReviewed
🏆Completed
CombinatoricsProbabilityTheoretical Computer Science·Captain: wurtle

A Limiting Satisfiability Threshold for Every Fixed Clause SizeResearch Paper

A random kkk-SAT formula on nnn Boolean variables is a conjunction of mmm independent random clauses, each an OR of kkk literals on distinct variables. As the clause density m/nm/nm/n grows, the formula changes from almost surely satisfiable to almost surely unsatisfiable. Random kkk-SAT is a central model in probabilistic combinatorics, the theory of algorithms and…

20 thms2 active usersReviewed
🏆Completed
Dynamical SystemsGraph TheoryProbability·Captain: wurtle

The free uniform spanning forest is a factor of IIDResearch Paper

A uniform spanning tree of a finite connected graph is a spanning tree chosen uniformly at random. On an infinite graph one takes limits along finite pieces: the free uniform spanning forest (FUSF) is the weak limit of uniform spanning trees of an increasing sequence of finite connected subgraphs, with no boundary identification. Uniform spanning forests…

11 thms2 active usersReviewed
🏆Completed
AnalysisMathematical PhysicsProbability·Captain: wurtle

A radial continuum phase transition with algebraic decayResearch Paper

Whether identical classical particles in R3\mathbb R^3R3, interacting only through a stable radial pair potential, can undergo a phase transition is a classical existence problem of rigorous statistical mechanics, highlighted in Simon's list of problems in mathematical physics (Simon 1984). A transition shows up as a singularity of the thermodynamic free…

14 thms2 active usersReviewed
🏆Completed
AnalysisMathematical PhysicsProbability·Captain: wurtle

A continuum temperature singularity for a radial pair potentialResearch Paper

Whether a single species of classical particles in R3\mathbb R^3R3, interacting only through a stable radial pair potential, can undergo a phase transition is one of the long-standing existence questions of rigorous statistical mechanics; it appears in Simon's list of problems in mathematical physics (Simon 1984). A phase transition is detected as a loss of…

5 thms2 active usersReviewed
🏆Completed
Markov ChainMathematical PhysicsProbability·Captain: wurtle

Stretched-exponential barriers for typical SK initial statesResearch Paper

In the low-temperature phase β>1\beta>1β>1 of the Sherrington–Kirkpatrick (SK) spin glass, the Gibbs measure is believed to split into many nearly separated pieces, and local dynamics such as heat-bath (Glauber) updates should take a very long time to move between them. Worst-case slow mixing (some bad starting state) is a weak statement: it says nothing about…

16 thms2 active usersReviewed
🏆Completed
Markov ChainMathematical PhysicsProbability·Captain: wurtle

Critical slowing down in the Sherrington–Kirkpatrick modelResearch Paper

The Sherrington–Kirkpatrick (SK) model is the mean-field spin glass, and β=1\beta=1β=1 is its equilibrium critical point. Physicists expect critical slowing down: at a phase transition, local dynamics needs time growing polynomially in the system size to relax. For the SK model this was studied through linearized mean-field theory, dynamical equations for…

8 thms2 active usersReviewed
🏆Completed
Markov ChainMathematical PhysicsProbability·Captain: wurtle

A spectral gap throughout the high-temperature Sherrington–Kirkpatrick phaseResearch Paper

The Sherrington–Kirkpatrick (SK) model (1975) is the basic mean-field spin glass: nnn Ising spins interact through independent Gaussian couplings of variance β2/n\beta^2/nβ2/n, so each spin is weakly coupled to every other one with random signs. The model is the testing ground for questions about disordered systems, about sampling from Gibbs measures, and about the…

12 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: wurtle

Exponential decay in two-dimensional classical O(n) modelsResearch Paper

The classical O(n)O(n)O(n) model (for n=3n=3n=3, the classical Heisenberg model) places a unit vector σx∈Sn−1\sigma_x\in S^{n-1}σx​∈Sn−1 at each site of the square lattice and favours alignment of neighbouring spins. It is the basic lattice model of a system with continuous symmetry. In two dimensions the Mermin–Wagner theorem rules out spontaneous magnetization at every positive…

7 thms2 active usersReviewed
🏆Completed
Graph TheoryGroup TheoryProbability·Captain: wurtle

No percolation at criticality on quasi-transitive graphsResearch Paper

In Bernoulli bond percolation on a graph G=(V,E)G=(V,E)G=(V,E), each edge is kept (open) independently with probability ppp. As ppp grows, an infinite connected component of open edges appears at the critical probability pc(G)p_c(G)pc​(G). The criticality problem asks whether an infinite cluster can already exist at pcp_cpc​. A negative answer means the phase transition is continuous.…

25 thms2 active usersReviewed
🏆Completed
CombinatoricsMathematical PhysicsProbability·Captain: wurtle

Brownian continuum random tree limits of finite Fortuin–Kasteleyn maps above fourResearch Paper

Random planar maps are graphs embedded in the sphere, chosen at random; they are the discrete models of two-dimensional quantum gravity. Decorating a map with a Fortuin–Kasteleyn (FK) random-cluster configuration with parameter qqq couples the geometry of the map to a statistical-mechanics model (percolation, Ising, Potts), and the coupling changes the…

4 thms2 active usersReviewed
🏆Completed
AlgebraAlgebraic GeometryRepresentation Theory·Captain: wurtle

Quadratic stabilization of the canonical Foulkes--Howe mapResearch Paper

Plethysm — decomposing Sym⁡a(Sym⁡bV)\operatorname{Sym}^a(\operatorname{Sym}^b V)Syma(SymbV) into irreducible GL(V)\mathrm{GL}(V)GL(V)-representations — is one of the oldest open problems in the representation theory of the general linear group, and it is central to geometric complexity theory, where the coordinate rings of Chow varieties of products of linear forms control lower-bound…

43 thms2 active usersReviewed
🏆Completed
AlgebraGroup Theory·Captain: wurtle

The Bass trace conjecture and the characteristic-zero Kaplansky idempotent conjectureResearch Paper

The Hattori–Stallings trace refines the rank of a finitely generated projective module over a group ring CG\mathbb CGCG into one complex number per conjugacy class of GGG. These numbers enter group-ring Euler characteristics, where they retain information that an ordinary numerical Euler characteristic forgets. Bass's trace conjecture (complex group-ring form)…

7 thms2 active usersReviewed
🏆Completed
CombinatoricsGroup TheoryRepresentation Theory·Captain: wurtle

Universal Tensor Squares for Symmetric GroupsResearch Paper

The irreducible complex representations of the symmetric group SnS_nSn​ are indexed by partitions λ⊢n\lambda\vdash nλ⊢n and written SλS^\lambdaSλ (Specht modules). Decomposing a tensor product Sλ⊗SμS^\lambda\otimes S^\muSλ⊗Sμ (with the diagonal action) into irreducibles is governed by the Kronecker coefficients

53 thms2 active usersReviewed
🏆Completed
AlgebraRepresentation Theory·Captain: wurtle

A counterexample to Tachikawa's second conjectureResearch Paper

Let AAA be a finite-dimensional algebra over a field. A finite-dimensional module MMM is self-orthogonal if Ext⁡Ai(M,M)=0\operatorname{Ext}^i_A(M,M)=0ExtAi​(M,M)=0 for every i>0i>0i>0. Tachikawa's second conjecture asserts that over a self-injective algebra every self-orthogonal module is projective. It belongs to the cluster of homological conjectures around quasi-Frobenius algebras and…

4 thms2 active usersReviewed
🏆Completed
AlgebraRepresentation Theory·Captain: wurtle

An explicit counterexample to the Auslander-Reiten conjectureResearch Paper

In the representation theory of finite-dimensional algebras, vanishing of Ext⁡\operatorname{Ext}Ext groups is the standard way of detecting projectivity homologically. The Auslander–Reiten conjecture (1975) asserts that a finitely generated module MMM over an Artin algebra RRR is projective as soon as

4 thms2 active usersReviewed
🏆Completed
AlgebraCategory TheoryRepresentation Theory·Captain: wurtle

An algebra of infinite little finitistic dimensionResearch Paper

Every module over a ring has a projective resolution, and its length, the projective dimension, measures how far the module is from being projective. Over a finite-dimensional algebra, some modules have infinite projective dimension; the finitistic dimension conjectures ask whether, among the modules whose projective dimension is finite, these finite values…

3 thms2 active usersReviewed
🏆Completed
AlgebraAlgebraic TopologyGroup Theory·Captain: wurtle

A Torsion-Free Group Algebra with Zero DivisorsResearch Paper

For a field KKK and a group GGG, the group algebra K[G]K[G]K[G] consists of finite formal sums ∑gagg\sum_g a_g g∑g​ag​g with ag∈Ka_g\in Kag​∈K, multiplied by extending the group law bilinearly. If g∈Gg\in Gg∈G has finite order m>1m>1m>1, then (1−g)(1+g+⋯+gm−1)=0(1-g)(1+g+\dots+g^{m-1})=0(1−g)(1+g+⋯+gm−1)=0, so K[G]K[G]K[G] has zero divisors. Kaplansky's zero-divisor conjecture asserts that this is the only source: if GGG is torsion-free, K[G]K[G]K[G] has…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: wurtle

Polynomial removal fails for ordered binary matricesResearch Paper

A removal lemma says that an object far from having a forbidden substructure must contain many copies of it. Such statements are the combinatorial backbone of property testing: if every matrix that is ϵ\epsilonϵ-far from avoiding a pattern HHH contains at least cHϵCHn2kc_H\epsilon^{C_H}n^{2k}cH​ϵCH​n2k copies of HHH, then sampling a number of rows and columns polynomial in …

2 thms2 active usersReviewed
PreviousPage 9 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