By OpenAISourceGitHub
Manuscripts from openai/math
Fork
Clone
git clone https://openversions.com/git/index/openai-math.gitCite
- Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f- Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.
Papers
- A C^1 Counterexample to the Entropy Conjecture
- A CH obstruction to a prescribed categoricity threshold
- A Capacity Criterion for Four-State Potts Reconstruction on Trees
- A Charged Reduction of the Spacetime Penrose Inequality in Spatial Dimensions at Least Four
- A Codimension-One Bound for the Singular Set of a Stationary Integral Varifold
- A Complete Local Domain without a Small Cohen–Macaulay Module
- A Conditional Reduction for Algebraic Kuga–Satake Correspondences
- A Coulomb ground-state density without Kohn-Sham ensemble representation
- A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Characteristic Two
- A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Odd Characteristic
- A Counterexample to Kurosh’s Division-Ring Problem
- A counterexample to Ryser's covering conjecture
- A Counterexample to Wall's D(2) Problem
- A Counterexample to the Group-Ring Determinant Conjecture
- A Counterexample to the Infinite Matroid Packing/Covering Conjecture
- A Cyclic Polytabloid Proof of Saxl's Conjecture
- A Direct Proof of Optimal Max-Cut Hardness
- A Fixed Particle Test for Computation in a Forced Viscous Flow
- A Fock-space inequality and the Laughlin spectral gap
- A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs
- A Gepner stability condition on every smooth quintic threefold
- A Limiting Satisfiability Threshold for Every Fixed Clause Size
- A Linear Clock for Random Walk on Tree-Weighted Planar Maps
- A logarithmic independence bound for clique-free graphs