Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (226 pages, 1005 entries) |
Automatic refresh from the published result pages (228 pages, 1051 entries) |
||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on | This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on 22 October 2026. The table can be re-sorted by any column. | ||
== Summary == | == Summary == | ||
* | * 228 result pages; 227 of them list at least one public follow-up. | ||
* | * 1051 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 353 | ||
** Formalizations: | ** Formalizations: 30 | ||
** Reviews and verifications: | ** Reviews and verifications: 524 | ||
** Critiques and corrections: 14 | ** Critiques and corrections: 14 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 130 | ||
== Results == | == Results == | ||
| Line 14: | Line 14: | ||
! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ||
|- | |- | ||
| [[The quasi-Riemann hypothesis]] || Number theory || | | [[The quasi-Riemann hypothesis]] || Number theory || 42 || 30 || 3 || 7 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 14 || 10 || 0 || 2 || 0 || 2 || 2026-10-21 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 14 || 10 || 0 || 2 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 12 || 7 || 0 || 0 || 1 || 4 || 2026-10-16 | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 12 || 7 || 0 || 0 || 1 || 4 || 2026-10-16 | ||
|- | |||
| [[The irrationality exponent of π is 2]] || Number theory || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-21 | |||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-21 | | [[The Unique Games Conjecture]] || Computational complexity || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-21 | ||
|- | |- | ||
| [[ | | [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 9 || 4 || 0 || 4 || 0 || 1 || 2026-10-20 | ||
|- | |- | ||
| [[Primitive roots for every admissible integer base]] || Number theory || 9 || 7 || 1 || 1 || 0 || 0 || 2026-10-19 | | [[Primitive roots for every admissible integer base]] || Number theory || 9 || 7 || 1 || 1 || 0 || 0 || 2026-10-19 | ||
| Line 37: | Line 39: | ||
|- | |- | ||
| [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | | [[Prime-factor statistics of p − 1]] || Number theory || 9 || 5 || 2 || 1 || 0 || 1 || 2026-10-17 | ||
|- | |||
| [[Hadwiger's conjecture]] || Combinatorics || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-16 | |||
|- | |||
| [[Irrationality of Catalan's constant]] || Number theory || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-21 | |||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 8 || 1 || 0 || 3 || 1 || 3 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 8 || 1 || 0 || 3 || 1 || 3 || 2026-10-20 | ||
|- | |||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | |||
|- | |- | ||
| [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | | [[Sidorenko's conjecture]] || Combinatorics || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-20 | ||
| Line 47: | Line 55: | ||
|- | |- | ||
| [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | | [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | ||
|- | |- | ||
| [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 61: | Line 67: | ||
|- | |- | ||
| [[A quadratic bound for Jacobsthal's function]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-14 | | [[A quadratic bound for Jacobsthal's function]] || Number theory || 8 || 3 || 0 || 2 || 0 || 3 || 2026-10-14 | ||
|- | |- | ||
| [[The generator problem for von Neumann algebras]] || Operator algebras || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-21 | | [[The generator problem for von Neumann algebras]] || Operator algebras || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | | [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | ||
| Line 75: | Line 75: | ||
|- | |- | ||
| [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-17 | |||
|- | |- | ||
| [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
|- | |||
| [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Sampling and counting contingency tables]] || Algorithms || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Sampling and counting contingency tables]] || Algorithms || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[The Hilbert–Smith conjecture]] || Geometric topology || 7 || 2 || 2 || 2 || 0 || 1 || 2026-10-16 | | [[The Hilbert–Smith conjecture]] || Geometric topology || 7 || 2 || 2 || 2 || 0 || 1 || 2026-10-16 | ||
| Line 89: | Line 95: | ||
|- | |- | ||
| [[The Falconer distance conjecture]] || Harmonic analysis || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-15 | | [[The Falconer distance conjecture]] || Harmonic analysis || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-15 | ||
|- | |||
| [[Erdős's conjecture on short Egyptian fractions]] || Number theory || 7 || 1 || 0 || 3 || 0 || 3 || 2026-10-10 | |||
|- | |- | ||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | | [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | ||
| Line 94: | Line 102: | ||
| [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | ||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
| Line 103: | Line 111: | ||
|- | |- | ||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Positive lower density of large prime gaps]] || Number theory || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Power-saving bounds for square-difference-free sets]] || Combinatorics || 6 || 2 || 0 || 3 || 0 || 1 || 2026-10-16 | | [[Power-saving bounds for square-difference-free sets]] || Combinatorics || 6 || 2 || 0 || 3 || 0 || 1 || 2026-10-16 | ||
| Line 117: | Line 127: | ||
|- | |- | ||
| [[The affine Bernstein problem]] || Differential geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The affine Bernstein problem]] || Differential geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 6 || 4 || 0 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 123: | Line 135: | ||
|- | |- | ||
| [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Uniform bounds for limit cycles in Hilbert's sixteenth problem]] || Dynamical systems || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-21 | | [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-21 | ||
| Line 133: | Line 141: | ||
|- | |- | ||
| [[Kaplansky's quasitrace conjecture]] || Operator algebras || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-21 | | [[Kaplansky's quasitrace conjecture]] || Operator algebras || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-21 | ||
|- | |||
| [[The Kollár–Pardon conjecture on semialgebraic universal covers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | |||
|- | |||
| [[Bounded gaps between primes]] || Number theory || 5 || 3 || 0 || 0 || 0 || 2 || 2026-10-20 | |||
|- | |- | ||
| [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-20 | | [[Glauber dynamics of the Sherrington–Kirkpatrick model]] || Probability || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-20 | ||
|- | |||
| [[Thompson's group F is nonamenable]] || Group theory || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-20 | |||
|- | |- | ||
| [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-19 | | [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-19 | ||
|- | |- | ||
| [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-16 | | [[A cubic lower bound for the permanent versus the determinant]] || Algebraic complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-16 | ||
| Line 157: | Line 169: | ||
|- | |- | ||
| [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Monochromatic finite sums and products in the positive integers]] || Combinatorics || 5 || 0 || 2 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
| Line 173: | Line 187: | ||
|- | |- | ||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Erdős similarity conjecture]] || Real analysis || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-16 | | [[The Gotsman–Linial conjecture]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-16 | ||
| Line 195: | Line 211: | ||
|- | |- | ||
| [[Thomason model structures on strict higher categories]] || Homotopy theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Thomason model structures on strict higher categories]] || Homotopy theory || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 5 || 1 || 4 || 0 || 0 || 0 || 2026-10-13 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 5 || 1 || 4 || 0 || 0 || 0 || 2026-10-13 | ||
| Line 203: | Line 217: | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | ||
|- | |- | ||
| [[The circulant Hadamard conjecture]] || Combinatorics || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-11 | | [[The circulant Hadamard conjecture]] || Combinatorics || 5 || 0 || 0 || 3 || 0 || 2 || 2026-10-11 | ||
| Line 233: | Line 245: | ||
|- | |- | ||
| [[Strong forms of the Arnold conjecture]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Strong forms of the Arnold conjecture]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Strong locality of unitary vertex operator algebras]] || Operator algebras || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Talagrand's expectation-threshold and discrete-convexity conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Talagrand's expectation-threshold and discrete-convexity conjectures]] || Combinatorics || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 238: | Line 252: | ||
| [[The Benjamini–Schramm percolation conjectures]] || Probability || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-16 | | [[The Benjamini–Schramm percolation conjectures]] || Probability || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The | | [[The Kervaire conjecture]] || Group theory || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 4 || 1 || 2 || 1 || 0 || 0 || 2026-10-16 | | [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 4 || 1 || 2 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |||
| [[The spin-one Haldane gap]] || Mathematical physics || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Wall's D(2) problem]] || Homotopy theory || 4 || 2 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Wall's D(2) problem]] || Homotopy theory || 4 || 2 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 4 || 3 || 0 || 0 || 0 || 1 || 2026-10-15 | | [[Sensitivity versus block sensitivity]] || Computational complexity || 4 || 3 || 0 || 0 || 0 || 1 || 2026-10-15 | ||
| Line 252: | Line 268: | ||
| [[Kaplansky's zero-divisor conjecture]] || Group theory || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[Kaplansky's zero-divisor conjecture]] || Group theory || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[ | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 4 || 3 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[Residual finiteness of hyperbolic groups]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | | [[Residual finiteness of hyperbolic groups]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | ||
|- | |- | ||
| [[The complete Crouzeix conjecture]] || Functional analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-13 | | [[The complete Crouzeix conjecture]] || Functional analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-13 | ||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
| Line 269: | Line 283: | ||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |- | ||
| [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The Partition Principle and the Axiom of Choice]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 285: | Line 297: | ||
|- | |- | ||
| [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Almost-linear-time maximum matching in general graphs]] || Algorithms || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[An exact Hausdorff gauge for SLE]] || Probability || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Brennan's conjecture]] || Complex analysis || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Brennan's conjecture]] || Complex analysis || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
| Line 291: | Line 305: | ||
|- | |- | ||
| [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Fourier extension for positively curved surfaces in three dimensions]] || Harmonic analysis || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |||
| [[Free energies of random perceptrons]] || Probability || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[GOE bulk universality for random regular graphs]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[GOE bulk universality for random regular graphs]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 297: | Line 313: | ||
|- | |- | ||
| [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Hilbert's tenth problem over the rational numbers]] || Number theory || 3 || 1 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Isomorphism of the free group factors]] || Operator algebras || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 303: | Line 321: | ||
|- | |- | ||
| [[Optimal mixing of the Thorp shuffle]] || Probability || 3 || 1 || 0 || 1 || 1 || 0 || 2026-10-16 | | [[Optimal mixing of the Thorp shuffle]] || Probability || 3 || 1 || 0 || 1 || 1 || 0 || 2026-10-16 | ||
|- | |||
| [[Ostmann's inverse Goldbach conjecture]] || Number theory || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | | [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 315: | Line 335: | ||
|- | |- | ||
| [[The Benson–Etingof–Ostrik conjecture for finite tensor categories]] || Algebra || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[The Benson–Etingof–Ostrik conjecture for finite tensor categories]] || Algebra || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Courtade–Kumar conjecture]] || Information theory || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[The Deligne–Drinfeld conjecture]] || Algebra || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[The Deligne–Drinfeld conjecture]] || Algebra || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The abelian Zilber–Pink conjecture]] || Algebraic geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The abelian Zilber–Pink conjecture]] || Algebraic geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The cycle–clique Ramsey conjecture]] || Combinatorics || 3 || 0 || 0 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[The equivariant cohomological Hikita conjecture]] || Algebraic geometry || 3 || 0 || 0 || 2 || 1 || 0 || 2026-10-16 | | [[The equivariant cohomological Hikita conjecture]] || Algebraic geometry || 3 || 0 || 0 || 2 || 1 || 0 || 2026-10-16 | ||
|- | |||
| [[The higher-dimensional Erdős distinct-distances conjecture]] || Discrete geometry || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[The ordinary double point volume gap]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[The ordinary double point volume gap]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The sharp constant in random triangle removal]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | | [[The sharp constant in random triangle removal]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Seymour's second-neighborhood conjecture]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-14 | | [[Seymour's second-neighborhood conjecture]] || Combinatorics || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-12 | | [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-12 | ||
| Line 337: | Line 359: | ||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[The Lang–Plaut problem]] || Functional analysis || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The Lang–Plaut problem]] || Functional analysis || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 359: | Line 375: | ||
|- | |- | ||
| [[Alperin's weight conjecture]] || Representation theory of algebras || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Alperin's weight conjecture]] || Representation theory of algebras || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Classifying spaces and geometric obstructions for Artin groups]] || Group theory || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Donovan's conjecture]] || Representation theory of algebras || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Donovan's conjecture]] || Representation theory of algebras || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 365: | Line 383: | ||
|- | |- | ||
| [[Finite-time singularities of Calabi flow]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Finite-time singularities of Calabi flow]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Fujita's freeness conjecture]] || Algebraic geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Geometric Langlands and the generalized Ramanujan conjecture over function fields]] || Number theory || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 397: | Line 417: | ||
|- | |- | ||
| [[The Phillips–Toms conjecture]] || Operator algebras || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The Phillips–Toms conjecture]] || Operator algebras || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The Solomon–Yau least-volume conjecture]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[The abundance conjecture for threefolds in positive characteristic]] || Algebraic geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The abundance conjecture for threefolds in positive characteristic]] || Algebraic geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 403: | Line 425: | ||
|- | |- | ||
| [[The critical dimension for one-phase Bernoulli minimizers]] || Partial differential equations || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[The critical dimension for one-phase Bernoulli minimizers]] || Partial differential equations || 2 || 0 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The existential theory of the reals in the counting hierarchy]] || Computational complexity || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[The hyperkähler SYZ conjecture]] || Algebraic geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The hyperkähler SYZ conjecture]] || Algebraic geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 417: | Line 441: | ||
|- | |- | ||
| [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 2 || 1 || 0 || 0 || 1 || 0 || 2026-10-15 | | [[Conformal invariance of square-lattice random-cluster interfaces]] || Probability || 2 || 1 || 0 || 0 || 1 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-12 | | [[Rigidity of the Turing degrees]] || Mathematical logic || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-12 | ||
|- | |- | ||
| [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | | [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | ||
|- | |- | ||
| [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Anticanonical nonvanishing under smooth semipositivity]] || Algebraic geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 451: | Line 461: | ||
|- | |- | ||
| [[The higher-dimensional Duke problem for torus packets]] || Number theory || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The higher-dimensional Duke problem for torus packets]] || Number theory || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The inhomogeneous Duffin–Schaeffer conjecture]] || Number theory || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Yau's uniformization conjecture]] || Differential geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Yau's uniformization conjecture]] || Differential geometry || 1 || 0 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[The Grothendieck homotopy hypothesis]] || Homotopy theory || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-15 | | [[The Grothendieck homotopy hypothesis]] || Homotopy theory || 1 || 1 || 0 || 0 || 0 || 0 || 2026-10-15 | ||
|- | |- | ||
| [[Griffiths' positivity conjecture]] || Algebraic geometry || 0 || 0 || 0 || 0 || 0 || 0 || — | | [[Griffiths' positivity conjecture]] || Algebraic geometry || 0 || 0 || 0 || 0 || 0 || 0 || — | ||
|} | |} | ||
Latest revision as of 09:27, 21 October 2026
This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on 22 October 2026. The table can be re-sorted by any column.
Summary
- 228 result pages; 227 of them list at least one public follow-up.
- 1051 follow-up entries in total:
- Research follow-ups: 353
- Formalizations: 30
- Reviews and verifications: 524
- Critiques and corrections: 14
- Catalogue entries, citations and exposition: 130
Results
How the counts are made
- Each row of a result page's follow-up table counts as one entry. A work that concerns several results appears on each of their pages and is counted once on each.
- Collection-wide efforts, such as the formal-statement review MathVet and the audit of the manuscripts without Lean, are counted on every page that lists them. They raise many counts by one or two.
- Rows that a page marks as earlier work, or as work cited by the original manuscript, are listed there for context and are not counted (9 rows at present).
- Entries are grouped by the relation stated in the table: extensions, uses and parallel work as research follow-ups; formalizations and implementations; reviews, verifications and replications; critiques and corrections; and catalogue entries, formal statements, citations, remarks and exposition.
- The counts describe what this wiki has recorded from public sources. They are not a measure of the importance or the correctness of a result, and a low count may only mean that follow-ups have not been found yet.
