AIProofWatch
The catalog

Choose what to follow.

Explore a broad field, or follow a focused topic or problem.

Clear search

Broad topics

Broad topic

Algebra

16 records

Groups, rings, representations, and algebraic structures, including their connections to geometry and topology.

Broad topic

Combinatorics

14 records

Patterns, colorings, and discrete constructions, including Ramsey theory, cap sets, and geometric combinatorics.

Focused topics and problems

Focused topic

Cap sets

1 record

A cap set is a subset of vectors over the three-element field containing no three distinct vectors in an arithmetic progression.

Focused topic

Mathematical physics

3 records

This topic follows mathematical statements in physical models, including gravitational inequalities and field equations; it does not turn a theorem into an experimental prediction.

Focused topic

Ramsey bounds

2 records

How large must a graph be before every coloring of its edges contains a prescribed monochromatic pattern?

Individual problem

Jacobsthal’s function

1 record

Jacobsthal’s function measures how long an interval can fail to contain an integer coprime to a number with a given count of distinct prime factors.

Individual problem

OpenAI reports: smooth unforced Euler blowup on R³

1 record

The manuscript reports smooth compactly supported divergence-free initial data on R³ whose unforced three-dimensional incompressible Euler solution has finite maximal lifespan, with unbounded velocity gradient and divergent time integral of maximum vorticity.

Individual problem

P versus NP

0 records

If a proposed solution can be checked efficiently, can a solution always be found efficiently?

Individual problem

The Ramsey number R(5,5)

0 records

Find the smallest number of vertices such that every red/blue coloring of a complete graph’s edges contains a monochromatic five-vertex clique.

Request an interest for editorial review →